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!)
A241218 Smallest number m such that A240808(m) = n. 3
2, 1, 0, 5, 10, 9, 14, 19, 15, 20, 28, 24, 23, 34, 27, 41, 37, 33, 44, 40, 36, 47, 61, 45, 53, 67, 48, 56, 70, 54, 62, 73, 57, 68, 94, 78, 71, 97, 81, 74, 100, 87, 77, 106, 90, 80, 109, 93, 86, 115, 96, 89, 121, 99, 146, 124, 105, 152, 127, 108, 155, 130 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

A240808(a(n)) = n and A240808(m) <> n for m < a(n).

LINKS

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

PROG

(Haskell)

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

a241218 = fromJust . (`elemIndex` a240808_list)

CROSSREFS

Cf. A120511.

Sequence in context: A331955 A185209 A316659 * A266904 A299198 A137477

Adjacent sequences:  A241215 A241216 A241217 * A241219 A241220 A241221

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Apr 17 2014

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 May 7 10:32 EDT 2021. Contains 343650 sequences. (Running on oeis4.)