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 A325852 #9 Jan 03 2021 14:00:37
%S A325852 1,1,1,2,2,3,3,5,6,6,9,11,11,15,19,19,26,31,31,41,49,53,62,75,81,97,
%T A325852 112,124,145,171,175,215,244,274,307,344,388,446,497,561,599,700,779,
%U A325852 881,981,1054,1184,1340,1500,1669,1767,2031,2237,2486,2765,2946,3300
%N A325852 Number of (strict) integer partitions of n whose differences of all degrees are nonzero.
%C A325852 The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (6,3,1) are (-3,-2). The zeroth differences are the sequence itself, while k-th differences for k > 0 are the differences of the (k-1)-th differences. The differences of all degrees of a sequence are the union of its zeroth through m-th differences, where m is the length of the sequence.
%H A325852 Fausto A. C. Cariboni, <a href="/A325852/b325852.txt">Table of n, a(n) for n = 0..250</a>
%e A325852 The a(1) = 1 through a(11) = 11 partitions (A = 10, B = 11):
%e A325852 (1) (2) (3) (4) (5) (6) (7) (8) (9) (A) (B)
%e A325852 (21) (31) (32) (42) (43) (53) (54) (64) (65)
%e A325852 (41) (51) (52) (62) (63) (73) (74)
%e A325852 (61) (71) (72) (82) (83)
%e A325852 (421) (431) (81) (91) (92)
%e A325852 (521) (621) (532) (A1)
%e A325852 (541) (542)
%e A325852 (631) (632)
%e A325852 (721) (641)
%e A325852 (731)
%e A325852 (821)
%t A325852 Table[Length[Select[IntegerPartitions[n],!MemberQ[Union@@Table[Differences[#,i],{i,Length[#]}],0]&]],{n,0,30}]
%Y A325852 The case for only degrees > 1 is A325874.
%Y A325852 Cf. A049988, A175342, A238423, A279945, A295370, A325328, A325468, A325545, A325850, A325851, A325875.
%K A325852 nonn
%O A325852 0,4
%A A325852 _Gus Wiseman_, May 31 2019