21638

Appears in sequences

• a(n) = Sum_{d|n} p(d), where p(d) = A000041 = number of partitions of d.at n=36A047968
• a(n) = 1 + (number of partitions of n, n>0).at n=37A052810
• Expansion of e.g.f. (1-x)^(-1/(1+log(1-x))).at n=6A088815
• Monotonic ordering of set S generated by these rules: if x and y are in S then 3xy-x-y is in S, and 2 is in S.at n=22A192529
• Numbers k such that (7*10^k + 71)/3 is prime.at n=28A270831
• Twice-partitioned numbers where the first partition is constant.at n=37A279787
• Number of partitions of partitions of n where all partitions have the same sum.at n=37A305551
• Number of non-isomorphic set multipartitions of weight n in which all parts have the same size.at n=37A306018
• Number of series-reduced planted achiral trees whose leaves span an initial interval of positive integers appearing with multiplicities an integer partition of n.at n=36A317099
• Number of ways to split an integer partition of n into consecutive subsequences with equal sums.at n=37A317715
• Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 2413. 0 <= k <= A342854(n).at n=46A342860
• Number of rectangular twice-partitions of n of type (P,R,P).at n=37A358833
• Number of multiset partitions of integer partitions of n with constant block sizes and constant block sums.at n=37A358835
• Row sums of A371783 and A371954 (k-quanimous partitions).at n=36A372121