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.

Showing 1-1 of 1 results.

A274271 Number of partitions of 3^n into at most four parts.

Original entry on oeis.org

1, 3, 18, 225, 4410, 105903, 2746098, 73140525, 1965803130, 52995903003, 1430162760978, 38607856205625, 1042353276205050, 28143008896575303, 759856474192364658, 20516081909157771525, 553933825501236490170, 14956209814120079146803, 403817633711525094117138
Offset: 0

Views

Author

Colin Barker, Jun 17 2016

Keywords

Crossrefs

A subsequence of A001400.
Cf. A274100 (2^n), A274272 (5^n).

Programs

  • PARI
    \\ b(n) is the coefficient of x^n in the g.f. 1/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).
    b(n) = round(real(68+36*(-1)^n+18*((-I)^n+I^n)+(16*exp(-2/3*I*n*Pi)*(1+I*sqrt(3)+2*exp((4*I*n*Pi)/3)))/(1+(-1)^(1/3))+59*(1+n)+9*(-1)^n*(1+n)+18*(1+n)*(2+n)+2*(1+n)*(2+n)*(3+n))/288)
    vector(20, n, n--; b(3^n))

Formula

Coefficient of x^(3^n) in 1/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).
Conjectures (Start)
a(n) = ((3+3^n)^2*(9+3^n))/144 for n>1.
a(n) = 40*a(n-1)-390*a(n-2)+1080*a(n-3)-729*a(n-4) for n>4.
G.f.: (1-37*x+288*x^2-405*x^3-81*x^4) / ((1-x)*(1-3*x)*(1-9*x)*(1-27*x)).
(End)
Showing 1-1 of 1 results.