This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A255972 Smallest number m such that A251604(m) = n. 2
 1, 2, 3, 5, 4, 8, 32, 15, 6, 10, 25, 12, 7, 18, 17, 21, 34, 24, 9, 31, 22, 35, 27, 28, 51, 40, 33, 43, 11, 46, 75, 52, 41, 57, 38, 60, 23, 48, 36, 62, 13, 65, 138, 74, 44, 67, 29, 69, 61, 76, 49, 83, 14, 86, 55, 71, 53, 26, 42, 80, 16, 93, 58, 98, 68, 90 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS If the conjecture in A251604 is true, this sequence is the inverse permutation. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a255972 = (+ 1) . fromJust . (`elemIndex` a251604_list) CROSSREFS Cf. A251604. Sequence in context: A182395 A244983 A059450 * A060000 A074050 A269368 Adjacent sequences:  A255969 A255970 A255971 * A255973 A255974 A255975 KEYWORD nonn AUTHOR Reinhard Zumkeller, Mar 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.

Last modified September 19 23:31 EDT 2019. Contains 327207 sequences. (Running on oeis4.)