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 A284910 #9 Apr 07 2017 01:36:19 %S A284910 1,1,1,2,3,5,12,27,89,296,1426,7108,58499,483330,6711480,109420549, %T A284910 2973772212,98872765938,6193924614094,495007377762304, %U A284910 79850366709300780,18640233243121488514,9131454268089695383606,7218306932686390208993280,13823416565311581226765397400 %N A284910 a(n) = A000009(A000041(n)). %H A284910 Alois P. Heinz, <a href="/A284910/b284910.txt">Table of n, a(n) for n = 0..40</a> %p A284910 with(numtheory): %p A284910 b:= proc(n) option remember; `if`(n=0, 1, add(add( %p A284910 `if`(d::odd, d, 0), d=divisors(j))*b(n-j), j=1..n)/n) %p A284910 end: %p A284910 a:= n-> b(combinat[numbpart](n)): %p A284910 seq(a(n), n=0..22); %t A284910 Table[PartitionsQ@ PartitionsP@ n, {n,0, 50}] (* _Indranil Ghosh_, Apr 07 2017 *) %Y A284910 Cf. A000009, A000041, A058699, A284908, A284909. %K A284910 nonn %O A284910 0,4 %A A284910 _Alois P. Heinz_, Apr 05 2017