19195

Appears in sequences

• S(n,1) + S(n-1,2) + S(n-2,3) + ... + S(n+1-k,k), where k = floor((n+1)/2) and S(i,j) are Stirling numbers of the second kind.at n=11A024427
• Number of partitions of n into >= 2 parts and with minimum part >= 2.at n=46A083751
• Number of partitions of n into aliquant parts (i.e., parts that do not divide n).at n=47A098743
• Number of squares (of nonnegative integers) that require n binary (base-2) digits.at n=32A126726
• Number of partitions of n that do not contain 1 as a part and whose parts are not the same divisor of n.at n=47A167928
• Antidiagonal sums of triangle of Stirling numbers of 2nd kind A048993.at n=13A171367
• Number of nondecreasing strings of numbers x(i=1..6) in -n..n with sum x(i)^3 equal to 0.at n=39A188280
• Number of triangular numbers T(k) between powers of 2, 2^(n-1) < T(k) <= 2^n.at n=31A190660
• Number of partitions of p=prime(n) into aliquant parts (i.e., parts that do not divide p, meaning any part except 1 and p).at n=14A260798
• Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^7)).at n=33A288342
• Number of integer partitions of n using relatively prime non-divisors of n.at n=46A298262
• Number of integer partitions of n into relatively prime parts that are all greater than 1.at n=46A302698
• Number of integer partitions of n with no part dividing all the others.at n=47A338470
• Except a(0)=1 and a(4)=0, number of integer partitions of n with no 1's and at least two parts.at n=47A379720