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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190133 Inverse permutation to A190132. 2
 1, 1886, 3771, 5656, 7541, 9059, 9216, 9373, 9530, 9687, 9844, 2, 159, 316, 473, 630, 787, 944, 1101, 1258, 1415, 1572, 1729, 1887, 2044, 2201, 2358, 2515, 2672, 2829, 2986, 3143, 3300, 3457, 3614, 3772, 3929, 4086, 4243, 4400, 4557, 4714, 4871, 5028, 5185 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(A190132(n)) = A190132(a(n)) = n. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 (full sequence) PROG (Haskell) import Data.List (elemIndex) import Data.Maybe (fromJust) a190133 n = a190133_list !! (n-1) a190133_list =    map (succ . fromJust . (`elemIndex` a190132_list)) [1..10000] CROSSREFS Sequence in context: A259960 A338705 A236613 * A029564 A235295 A237540 Adjacent sequences:  A190130 A190131 A190132 * A190134 A190135 A190136 KEYWORD nonn,base,fini,full AUTHOR Reinhard Zumkeller, May 06 2011 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 December 6 13:45 EST 2021. Contains 349563 sequences. (Running on oeis4.)