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 A046064 #26 Feb 16 2025 08:32:38
%S A046064 13,17,19,23,26,29,31,34,37,38,39,41,43,46,47,51,52,53,57,58,59,61,62,
%T A046064 65,67,68,69,71,73,74,76,78,79,82,83,85,86,87,89,91,92,93,94,95,97,
%U A046064 102,103,104,106,107,109,111,113,114,115,116,117,118,119,122,123,124,127
%N A046064 Not a product of partition numbers (A000041).
%H A046064 Robin Jones, <a href="/A046064/b046064.txt">Table of n, a(n) for n = 1..10000</a>
%H A046064 G. K. Patil, <a href="https://web.archive.org/web/20150911053452/http://www.ijsres.com/2014/vol-1_issue-6/paper_8.pdf">Ramanujan's Life And His Contributions In The Field Of Mathematics</a>, International Journal of Scientific Research and Engineering Studies (IJSRES), 1(6) (2014), ISSN: 2349-8862.
%H A046064 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AbelianGroup.html">Abelian Group</a>.
%H A046064 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PartitionFunctionPCongruences.html">Partition Function P Congruences</a>.
%p A046064 with(combinat): A000041:=proc(n) options remember: RETURN(numbpart(n)): end: partdiv:=proc(m,i) local j,q,f: f:=0: for j from i by -1 to 2 while(f=0) do if(irem(m, A000041(j))=0) then q:=iquo(m, A000041(j)): if(q=1) then RETURN(1) else f:=partdiv(q,j) fi fi od: RETURN(f): end: for i from 2 to 14 do for n from A000041(i) to A000041(i+1)-1 do m:=partdiv(n,i): if m=0 then printf("%d, ",n) fi od od: # C. Ronaldo
%Y A046064 Cf. A000041, A046056, A046063, A033637.
%K A046064 nonn
%O A046064 1,1
%A A046064 _Eric W. Weisstein_