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!)
A258354 Smallest m such that A212306(m) = n. 2
1, 3, 6, 7, 10, 16, 34, 23, 32, 160, 18, 159, 30, 63, 370, 458, 42, 60, 81, 79, 101, 94, 123, 100, 1528, 215, 494, 522, 1037, 147, 1363, 697, 178, 302, 276, 1336, 212, 804, 186, 226, 267, 815, 117, 125, 170, 216, 312, 883, 906, 360, 206, 258, 311, 354, 337 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A212306(a(n)) = n and A212306(m) != n for m < a(n).

LINKS

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

PROG

(Haskell)

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

a258354 = (+ 1) . fromJust . (`elemIndex` a212306_list)

CROSSREFS

Cf. A212306.

Sequence in context: A255508 A262972 A115127 * A164557 A292608 A028754

Adjacent sequences:  A258351 A258352 A258353 * A258355 A258356 A258357

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, May 27 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 April 10 19:18 EDT 2021. Contains 342853 sequences. (Running on oeis4.)