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.

A295868 Initial digit of the number of partitions of n.

Original entry on oeis.org

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

Views

Author

José Hernández, Feb 13 2018

Keywords

Crossrefs

Programs

  • Mathematica
    (* The first one hundred terms of the sequence *)
    Join[{1}, First[IntegerDigits[PartitionsP[#]]] & /@ Range[99]]
    f[n_] := Block[{p = PartitionsP@ n}, Floor[p/10^Floor@ Log10@ p]]; Array[f, 105, 0] (* Robert G. Wilson v, Feb 18 2018 *)
  • PARI
    a(n) = digits(numbpart(n))[1]; \\ Michel Marcus, Feb 16 2018

Formula

a(n) = A000030(A000041(n)).