A253603 - OEIS

A253603

Smallest number m such that A253581(m) = n.

0, 1, 2, 18, 3, 70, 39, 75, 10, 193, 16, 85, 124, 23, 51, 200, 20, 79, 41, 303, 28, 102, 98, 1105, 71, 115, 73, 301, 543, 152, 325, 344, 15, 64, 27, 125, 47, 66, 170, 179, 306, 93, 289, 1174, 49, 376, 1195, 440, 45, 566, 312, 1170, 104, 2133, 108, 468, 162

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

A253581(a(n)) = n; conjecture: the sequence is defined for all n.

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000

PROG

(Haskell)

import Data.List (elemIndex); import Data.Maybe (fromJust)

a253603 = fromJust . (`elemIndex` a253581_list)

CROSSREFS