cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A050001 a(n)=position of n in A050000.

Original entry on oeis.org

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
Offset: 1

Views

Author

Keywords

Comments

Inverse permutation to A050000: a(A050000(n)) = A050000(a(n)) = n.

Crossrefs

a(n) = k <=> A050000(k) = n.

Programs

  • Haskell
    import Data.List (elemIndex)
    import Data.Maybe (fromJust)
    a050001 n = (fromJust $ elemIndex n a050000_list) + 1
    -- Reinhard Zumkeller, Nov 13 2011

Extensions

More terms from Ray Chandler, Nov 16 2003