login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A253603 Smallest number m such that A253581(m) = n. 3
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

Cf. A253581, A252867.

Sequence in context: A266166 A077452 A113918 * A094048 A179073 A087665

Adjacent sequences:  A253600 A253601 A253602 * A253604 A253605 A253606

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jan 12 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 07:39 EDT 2021. Contains 348048 sequences. (Running on oeis4.)