login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257078 Smallest number m such that A248756(m) = n. 2
1, 4, 3, 11, 18, 13, 7, 23, 39, 42, 64, 27, 43, 29, 15, 47, 78, 141, 142, 212, 278, 83, 241, 55, 86, 149, 150, 59, 90, 61, 31, 95, 158, 285, 286, 541, 542, 1051, 796, 931, 483, 167, 485, 295, 422, 171, 489, 111, 174, 301, 302, 557, 558, 179, 497, 119, 182 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A248756(a(n)) = n and A248756(m) != n for m < a(n).
LINKS
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a257078 = (+ 1) . fromJust . (`elemIndex` a248756_list)
CROSSREFS
Cf. A248756.
Sequence in context: A080777 A001166 A065337 * A072802 A093726 A126604
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Apr 15 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 9 01:56 EDT 2024. Contains 375024 sequences. (Running on oeis4.)