A281245 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A281245

Expansion of Product_{k>=1} (1 + x^(7*k-1)).

1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 1, 3, 1, 0, 0, 0, 0, 2, 3, 1, 0, 0, 0, 0, 3, 4, 1, 0, 0, 0, 1, 4, 4, 1, 0, 0, 0, 1, 5, 5, 1, 0, 0, 0, 2, 7, 5, 1, 0, 0, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,34

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000

FORMULA

a(n) ~ exp(sqrt(n/21)*Pi) / (2^(13/7)*21^(1/4)*n^(3/4)) * (1 + (13*Pi/(336*sqrt(21)) - 3*sqrt(21)/(8*Pi)) / sqrt(n)). - Vaclav Kotesovec, Jan 18 2017, extended Jan 24 2017

G.f.: Sum_{k>=0} x^(k*(7*k + 5)/2) / Product_{j=1..k} (1 - x^(7*j)). - Ilya Gutkovskiy, Nov 24 2020

MATHEMATICA

nmax = 200; CoefficientList[Series[Product[(1 + x^(7*k - 1)), {k, 1, nmax}], {x, 0, nmax}], x]

nmax = 200; poly = ConstantArray[0, nmax + 1]; poly[[1]] = 1; poly[[2]] = 0; Do[If[Mod[k, 7] == 6, Do[poly[[j + 1]] += poly[[j - k + 1]], {j, nmax, k, -1}]; ], {k, 2, nmax}]; poly

CROSSREFS

Cf. A262928, A147599, A281243, A281244.

Cf. A261612, A169975, A280454.

Cf. A109708, A281455, A281456, A281457, A281458, A280457, A281459.

Sequence in context: A124744 A124788 A284504 * A284499 A280457 A349903

Adjacent sequences: A281242 A281243 A281244 * A281246 A281247 A281248

KEYWORD

nonn

AUTHOR

Vaclav Kotesovec, Jan 18 2017

STATUS

approved