26252

Appears in sequences

• Number of partitions of n that do not contain 1 as a part.at n=49A002865
• a(0) = 1, a(n) = 42*n^2 + 2 for n>0.at n=25A010023
• Number of labeled rooted trees with n leaves in which the degrees of the root and all internal nodes are >= 3.at n=9A052526
• Numbers n for which there are exactly twelve k such that n = k + reverse(k).at n=22A072435
• Number of partitions of n including 3, but not 1.at n=51A085811
• Number of partitions of n in which both smallest and largest part occur only once.at n=48A117995
• First differences of A160379.at n=29A163989
• Bisection (odd part) of number of partitions that do not contain 1 as a part A002865.at n=24A182747
• Number of partitions of n that do not contain parts less than the smallest part of the partitions of n-1.at n=48A187219
• Number of 3Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=11A240794
• First differences of 1/p(n), reciprocal of the number p(n) of unrestricted partitions of n (negated numerator).at n=48A272339
• Numbers k such that 8*10^k + 87 is prime.at n=22A293397