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.

A286934 Number of partitions of n into centered square primes (A027862).

This page as a plain text file.
%I A286934 #5 Feb 16 2025 08:33:45
%S A286934 1,0,0,0,0,1,0,0,0,0,1,0,0,1,0,1,0,0,1,0,1,0,0,1,0,1,1,0,1,0,1,1,0,1,
%T A286934 0,1,1,0,1,1,1,2,0,1,1,1,2,0,1,1,1,2,1,1,2,1,2,1,1,2,1,3,1,1,2,2,3,2,
%U A286934 1,2,2,3,2,1,3,2,3,2,2,3,3,3,3,2,3,3,3,4,2,3,3,4,4,3,3,4,4,4,3,3,5
%N A286934 Number of partitions of n into centered square primes (A027862).
%H A286934 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CenteredSquareNumber.html">Centered Square Number</a>
%H A286934 <a href="/index/Ce#CENTRALCUBE">Index entries for sequences related to centered polygonal numbers</a>
%H A286934 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A286934 G.f.: Product_{k>=1} 1/(1 - x^A027862(k)).
%e A286934 a(41) = 2 because we have [41] and [13, 13, 5, 5, 5].
%t A286934 nmax = 100; CoefficientList[Series[Product[1/(1 - x^k), {k, Select[Range[nmax]^2 + (Range[nmax] + 1)^2, PrimeQ]}], {x, 0, nmax}], x]
%Y A286934 Cf. A000607, A001844, A027862, A280951, A282970.
%K A286934 nonn
%O A286934 0,42
%A A286934 _Ilya Gutkovskiy_, May 16 2017