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.

A261333 a(n) = 10*(A256100(n+1)-1) + A007376(n+1), a simple variation of A065649.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 0, 21, 31, 41, 12, 51, 13, 61, 14, 71, 15, 81, 16, 91, 17, 101, 18, 111, 19, 22, 10, 32, 121, 42, 52, 62, 23, 72, 24, 82, 25, 92, 26, 102, 27, 112, 28, 122, 29, 33, 20, 43, 131, 53, 132, 63, 73, 83, 34, 93, 35, 103, 36, 113, 37
Offset: 0

Views

Author

Reinhard Zumkeller, Aug 15 2015

Keywords

Comments

Permutation of the nonnegatve integers with inverse A261334.

Crossrefs

Cf. A256100, A007376, A261334 (inverse), A261335 (fixed points), A065649.

Programs

  • Haskell
    a261333 n = a261333_list !! n
    a261333_list = zipWith (+)
                   (map ((* 10) . subtract 1) a256100_list) a007376_list