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!)
 A255833 Index i such that A166133(i)=n, or 0 if no such i exists. 4
 1, 2, 4, 3, 8, 7, 6, 5, 12, 11, 10, 9, 16, 15, 14, 13, 21, 20, 19, 18, 17, 24, 23, 22, 29, 28, 27, 26, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 25 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS If A166133 is a permutation, as conjectured, then this is the inverse permutation. LINKS M. F. Hasler, Table of n, a(n) for n = 1..10000 Ray Chandler, Table of n, a(n) for n=1..3743853 (55 MB) PROG (PARI) a(n)=for(i=1, #a166133, a166133[i]==n&&return(i)) \\ assumes a166133 defined as a vector, e.g., via {c=0; a166133=apply(t->eval(concat(Vec(t)[1+#Str(c++) .. -1])), readstr("/tmp/b166133.txt"))} (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a255833 = (+ 1) . fromJust . (`elemIndex` a166133_list) -- Reinhard Zumkeller, Apr 02 2015 CROSSREFS Cf. A166133, A256561, A256563. Sequence in context: A101283 A243496 A125566 * A166133 A237739 A111699 Adjacent sequences:  A255830 A255831 A255832 * A255834 A255835 A255836 KEYWORD nonn AUTHOR M. F. Hasler, Apr 01 2015 EXTENSIONS Definition simplified by Franklin T. Adams-Watters, Apr 01 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 22 11:29 EDT 2020. Contains 337289 sequences. (Running on oeis4.)