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.

A320795 Number of multisets of exactly ten partitions of positive integers into distinct parts with total sum of parts equal to n.

Original entry on oeis.org

1, 1, 3, 5, 11, 19, 37, 63, 115, 195, 339, 565, 954, 1565, 2580, 4174, 6751, 10775, 17161, 27051, 42510, 66261, 102900, 158746, 243955, 372778, 567443, 859492, 1296958, 1948458, 2916636, 4348377, 6460535, 9563222, 14109242, 20744995, 30405638, 44422190
Offset: 10

Views

Author

Alois P. Heinz, Oct 21 2018

Keywords

Crossrefs

Column k=10 of A285229.
Cf. A000009.

Programs

  • Maple
    g:= proc(n) option remember; `if`(n=0, 1, add(add(`if`(d::odd,
          d, 0), d=numtheory[divisors](j))*g(n-j), j=1..n)/n)
        end:
    b:= proc(n, i) option remember; series(`if`(n=0, 1, `if`(i<1, 0,
          add(b(n-i*j, i-1)*x^j*binomial(g(i)+j-1, j), j=0..n/i))), x, 11)
        end:
    a:= n-> coeff(b(n$2), x, 10):
    seq(a(n), n=10..60);

Formula

a(n) = [x^n y^10] Product_{j>=1} 1/(1-y*x^j)^A000009(j).