A279041 Expansion of Product_{k>=1} 1/(1 - x^(k*(3*k-2))).

1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 10, 10, 11, 11, 11, 12, 12, 12, 14, 14, 15, 15, 15, 16, 16, 16, 18, 18, 19, 19, 19, 21, 21, 22, 24, 25, 26, 26, 26, 28, 28, 29, 31, 32, 33, 33, 33, 35, 35, 36, 39, 40, 42, 42, 43, 45, 46, 47, 50, 51, 53

Offset

0,9

Comments

Number of partitions of n into nonzero octagonal numbers (A000567).

Links

Alois P. Heinz, Table of n, a(n) for n = 0..20000

M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]

M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]

Eric Weisstein's World of Mathematics, Octagonal Number

Index to sequences related to polygonal numbers

Index entries for related partition-counting sequences

Formula

G.f.: Product_{k>=1} 1/(1 - x^(k*(3*k-2))).

Example

a(9) = 2 because we have [8, 1] and [1, 1, 1, 1, 1, 1, 1, 1, 1].

Maple

h:= proc(n) option remember; `if`(n<1, 0, (t->
      `if`(t*(3*t-2)>n, t-1, t))(1+h(n-1)))
    end:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
      b(n, i-1)+(t-> b(n-t, min(i, h(n-t))))(i*(3*i-2))))
    end:
a:= n-> b(n, h(n)):
seq(a(n), n=0..100);  # Alois P. Heinz, Dec 28 2018

Mathematica

nmax=90; CoefficientList[Series[Product[1/(1 - x^(k (3 k - 2))), {k, 1, nmax}], {x, 0, nmax}], x]

Crossrefs

Cf. A000567, A001156, A007294, A037444, A218379, A278949, A279012.

Sequence in context: A214956 A209899 A111898 * A072746 A179528 A105390

Adjacent sequences: A279038 A279039 A279040 * A279042 A279043 A279044

Keyword

nonn,easy

Author

Ilya Gutkovskiy, Dec 04 2016

Status

approved