25210

Appears in sequences

• Numbers that contain as proper substrings every maximal prime power dividing them.at n=16A059401
• Sum of smallest parts (counted with multiplicity) of all partitions of n into odd parts.at n=47A092313
• Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^(-6).at n=28A114358
• Triangle defined by g.f.: Sum_{n>=0} (4*n)!/n!^4 * x^(2*n)*y^n/(1-x-x*y)^(4*n+1), read by rows.at n=17A183065
• Triangle defined by g.f.: Sum_{n>=0} (4*n)!/n!^4 * x^(2*n)*y^n/(1-x-x*y)^(4*n+1), read by rows.at n=18A183065
• Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) = cn(2,5) = cn(3,5).at n=15A202088
• Number of partitions of n containing at least one prime.at n=38A235945