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.
%I A140952 #23 Jun 18 2021 19:41:00
%S A140952 1,0,1,1,1,2,2,3,3,4,5,6,7,8,10,11,13,15,17,19,22,25,28,31,35,39,43,
%T A140952 48,53,58,64,70,77,84,91,100,108,117,127,137,148,159,172,184,198,212,
%U A140952 227,243,259,277,295,314,334,355,377,400,424,449,475,502,531,560
%N A140952 Expansion of 1/((1-x^2)*(1-x^3)*(1-x^5)*(1-x^7)*(1-x^11)).
%C A140952 Number of partitions of n into the first 5 primes.
%H A140952 Alois P. Heinz, <a href="/A140952/b140952.txt">Table of n, a(n) for n = 0..10000</a>
%H A140952 <a href="/index/Rec#order_28">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,1,0,0,0,0,-1,-1,0,1,0,-1,0,1,0,-1,0,1,1,0,0,0,0,-1,-1,0,1).
%p A140952 M := Matrix(28, (i,j)-> if (i=j-1) or (j=1 and member(i, [2, 3, 11, 15, 19, 20, 28])) then 1 elif j=1 and member(i, [8, 9, 13, 17, 25, 26]) then -1 else 0 fi):
%p A140952 a:= n-> (M^(n))[1,1]:
%p A140952 seq(a(n), n=0..50);
%t A140952 CoefficientList[Series[1/Times@@(1-x^Prime[Range[5]]),{x,0,70}],x] (* or *) LinearRecurrence[{0,1,1,0,0,0,0,-1,-1,0,1,0,-1,0,1,0,-1,0,1,1,0,0,0,0,-1,-1,0,1},{1,0,1,1,1,2,2,3,3,4,5,6,7,8,10,11,13,15,17,19,22,25,28,31,35,39,43,48},70] (* _Harvey P. Dale_, Jun 18 2021 *)
%Y A140952 Cf. A000040, A025795, A029144, A103221, A140953, A335106.
%K A140952 nonn,easy
%O A140952 0,6
%A A140952 _Alois P. Heinz_, Jul 25 2008