This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A257455 Smallest m such that A257339(m) = n. 2
 1, 2, 3, 5, 4, 7, 6, 13, 9, 24, 8, 26, 10, 28, 29, 34, 11, 39, 12, 65, 16, 36, 14, 41, 17, 43, 31, 55, 15, 86, 18, 45, 44, 57, 21, 84, 19, 59, 33, 78, 20, 243, 22, 98, 62, 82, 23, 113, 25, 80, 37, 96, 27, 115, 32, 129, 46, 104, 30, 164, 35, 106, 72, 108, 40 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A257339(a(n)) = n. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a257455 = (+ 1) . fromJust . (`elemIndex` a257339_list) CROSSREFS Cf. A257339. Sequence in context: A117120 A181095 A276345 * A127515 A256996 A316668 Adjacent sequences:  A257452 A257453 A257454 * A257456 A257457 A257458 KEYWORD sign AUTHOR Reinhard Zumkeller, Apr 24 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.

Last modified January 17 22:44 EST 2019. Contains 319251 sequences. (Running on oeis4.)