The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A050001 a(n)=position of n in A050000. 3
 1, 5, 2, 4, 19, 6, 16, 26, 3, 18, 23, 28, 10, 15, 20, 25, 61, 7, 12, 35, 17, 22, 76, 27, 45, 130, 9, 14, 135, 37, 73, 91, 24, 60, 127, 29, 47, 65, 11, 34, 52, 70, 88, 478, 21, 75, 124, 93, 359, 44, 62, 129, 594, 8, 49, 116, 13, 134, 506, 36, 54, 431, 72, 90, 139, 480, 41, 59 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Inverse permutation to A050000: a(A050000(n)) = A050000(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) a050001 n = (fromJust \$ elemIndex n a050000_list) + 1 -- Reinhard Zumkeller, Nov 13 2011 CROSSREFS a(n) = k <=> A050000(k) = n. Sequence in context: A248261 A264991 A088507 * A166199 A324860 A008566 Adjacent sequences:  A049998 A049999 A050000 * A050002 A050003 A050004 KEYWORD nonn,easy AUTHOR EXTENSIONS More terms from Ray Chandler, Nov 16 2003 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 May 9 10:52 EDT 2021. Contains 343732 sequences. (Running on oeis4.)