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.

A294624 Number of partitions of n into distinct generalized octagonal numbers (A001082).

This page as a plain text file.
%I A294624 #5 Feb 16 2025 08:33:51
%S A294624 1,1,0,0,0,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,0,2,2,0,1,1,1,1,0,2,2,0,0,1,
%T A294624 2,1,0,1,2,1,1,2,2,1,0,2,3,1,1,2,2,1,0,1,3,2,2,3,1,1,1,3,5,2,2,3,2,2,
%U A294624 1,3,5,2,1,3,3,2,1,3,6,3,1,3,4,3,1,4,7,3,0,3,6,4,1,2,7,5,2,4,5,5,2
%N A294624 Number of partitions of n into distinct generalized octagonal numbers (A001082).
%H A294624 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/OctagonalNumber.html">Octagonal Number</a>
%H A294624 <a href="/index/Pol#polygonal_numbers">Index to sequences related to polygonal numbers</a>
%H A294624 <a href="/index/Par#part">Index entries for related partition-counting sequences</a>
%F A294624 G.f.: Product_{k>=1} (1 + x^(k*(3*k-2)))*(1 + x^(k*(3*k+2))).
%e A294624 a(21) = 2 because we have [21] and [16, 5].
%t A294624 nmax = 100; CoefficientList[Series[Product[(1 + x^(k (3 k - 2))) (1 + x^(k (3 k + 2))), {k, 1, nmax}], {x, 0, nmax}], x]
%Y A294624 Cf. A001082, A024940, A279281, A290942, A294622, A294623.
%K A294624 nonn
%O A294624 0,22
%A A294624 _Ilya Gutkovskiy_, Nov 05 2017