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 A368869 #6 Jan 15 2024 11:13:40
%S A368869 1,0,0,0,1,0,1,0,1,2,2,2,3,2,3,3,3,3,4,3,4,4,4,4,5,15,16,17,18,19,21,
%T A368869 21,23,24,25,27,28,29,31,32,34,35,37,38,40,42,43,45,47,150,158,166,
%U A368869 175,183,193,202,212,222,232,243,254,265,277,289,301,314,327,340,354,368,383
%N A368869 Number of partitions of n into prime parts not greater than sqrt(n).
%p A368869 b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
%p A368869 b(n, i-1)+`if`(isprime(i), b(n-i, min(n-i, i)), 0)))
%p A368869 end:
%p A368869 a:= n-> b(n, floor(sqrt(n))):
%p A368869 seq(a(n), n=0..70); # _Alois P. Heinz_, Jan 13 2024
%t A368869 Table[SeriesCoefficient[Product[1/(1 - Boole[PrimeQ[k]] x^k), {k, 1, Floor[Sqrt[n]]}], {x, 0, n}], {n, 0, 70}]
%Y A368869 Cf. A000607, A097356.
%K A368869 nonn
%O A368869 0,10
%A A368869 _Ilya Gutkovskiy_, Jan 08 2024