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.

A219922 Smallest m such that n is contained in m-th row of A026835.

Original entry on oeis.org

1, 3, 5, 6, 7, 8, 11, 9, 15, 10, 19, 11, 23, 29, 12, 27, 16, 13, 37, 20, 17, 14, 24, 21, 18, 28, 15, 22, 19, 29, 26, 16, 36, 33, 20, 27, 37, 17, 31, 44, 21, 38, 35, 25, 32, 18, 29, 22, 36, 46, 26, 56, 40, 19, 30, 23, 44, 34, 27, 51, 64, 31, 58, 20, 97, 24
Offset: 1

Views

Author

Reinhard Zumkeller, Dec 01 2012

Keywords

Comments

A026835(a(n),k) = n for some k.

Programs

  • Haskell
    import Data.List (findIndex)
    import Data.Maybe (fromJust)
    a219922 n = (fromJust $ findIndex (n `elem`) a026835_tabl) + 1