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.

A241235 a(n) = number of times n appears in A006949.

Original entry on oeis.org

3, 3, 1, 4, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 6, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 7, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 8, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 17 2014

Keywords

Comments

Is this (with an exception at n=1) the same as A135560? - R. J. Mathar, Apr 26 2014

Crossrefs

Cf. A051135.

Programs

  • Haskell
    a241235 n = a241235_list !! (n-1)
    a241235_list = map length $ group a006949_list