48508

Appears in sequences

• Twice partitioned numbers: the number of ways a number can be partitioned into not necessarily different parts and each part is again so partitioned.at n=16A063834
• Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,9}) exceeds the largest prime factor of product(n+k, {k,0,9}).at n=20A200567
• Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,13}) exceeds the largest prime factor of product(n+k, {k,0,13}).at n=45A209837
• Number of integer partitions of n with frequency depth floor(sqrt(n)).at n=45A325252
• a(n) = coefficient of x^n in the power series A(x) such that: 1 = Sum_{n=-oo..+oo} x^(n+1) * (2 - x^(n+1))^n * A(x)^n.at n=8A357798
• a(n) = greatest number in row n of the array in A225485.at n=44A364810