OFFSET
0,3
COMMENTS
Different from A018819 (see g.f.). - Joerg Arndt, Apr 22 2016
REFERENCES
D. J. Benson, Polynomial Invariants of Finite Groups, Cambridge, 1993, p. 105.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 245
Index entries for linear recurrences with constant coefficients, signature (1, 1, -1, 1, -1, -1, 1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, -1, -1, 1, 1, -1, -1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, 1, -1, -1, 1, -1, 1, 1, -1).
FORMULA
G.f.: 1/((1-x)*(1-x^2)*(1-x^4)*(1-x^8)*(1-x^16)*(1-x^32)).
MAPLE
seq(coeff(series( 1/mul((1-x^(2^j)), j=0..5)), x, n+1), x, n), n = 0..50); # G. C. Greubel, Feb 02 2020
MATHEMATICA
CoefficientList[Series[1/(1-x)/(1-x^2)/(1-x^4)/(1-x^8)/(1-x^16)/(1-x^32), {x, 0, 100}], x] (* Vaclav Kotesovec, Apr 22 2016 *)
PROG
(PARI) Vec( 1/prod(j=0, 5, 1-x^(2^j)) +O('x^50) ) \\ G. C. Greubel, Feb 02 2020
(Magma) R<x>:=PowerSeriesRing(Integers(), 50); Coefficients(R!( 1/(&*[1-x^(2^j): j in [0..5]]) )); // G. C. Greubel, Feb 02 2020
(Sage)
def A008645_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P( 1/product(1-x^(2^j) for j in (0..5)) ).list()
A008645_list(50) # G. C. Greubel, Feb 02 2020
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved