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.

A094909 Let p_k(n) = number of partitions of n into exactly k parts; sequence gives p_3(n-3) + p_2(n-2) + 1.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 4, 4, 6, 7, 9, 10, 13, 14, 17, 19, 22, 24, 28, 30, 34, 37, 41, 44, 49, 52, 57, 61, 66, 70, 76, 80, 86, 91, 97, 102, 109, 114, 121, 127, 134, 140, 148, 154, 162, 169, 177, 184, 193, 200, 209, 217, 226, 234, 244, 252, 262, 271, 281, 290, 301, 310, 321
Offset: 0

Views

Author

N. J. A. Sloane, Jun 18 2004

Keywords

Crossrefs

p_k(n) = A008284(n,k).

Programs

  • PARI
    Vec((x^7-x^6-x^5-x^4+x^3+x^2-1)/((1+x)*(x^2+x+1)*(x-1)^3) + O(x^80)) \\ Michel Marcus, Jul 19 2015

Formula

G.f.: (x^7-x^6-x^5-x^4+x^3+x^2-1)/((1+x)*(x^2+x+1)*(x-1)^3). - Alois P. Heinz, Jul 19 2015
72*a(n) = 8*A099837(n+3) +27*(-1)^n +29 +6*n^2, (n>1). - R. J. Mathar, Nov 15 2019

Extensions

a(0)=1 prepended by Alois P. Heinz, Jul 19 2015