19215

Appears in sequences

• Odd primitive abundant numbers.at n=26A006038
• a(n) = (n^4 + n)/2 (Row sums of an n X n X n magic cube, when it exists).at n=14A027441
• Sums of 3 distinct powers of 7.at n=17A038482
• Numbers of the form k*(k^3 +- 1)/2.at n=27A057590
• Convolution of Fibonacci F(n+1), n>=0, with F(n+9), n>=0.at n=9A067977
• Odd primitive numbers such that n! divided by product of factorials of all proper divisors of n is not an integer.at n=23A075460
• Stirling-like number triangle defined by the sequence A000292=C(n+3,3).at n=24A080249
• Expansion of 1/((1-x)(1-4x)(1-10x)(1-20x)).at n=3A080250
• Magic constant of smallest order-n perfect magic cube.at n=13A109130
• Partial sums of A051941.at n=19A136105
• a(n) = ((2^b-1)/phi(n))*Sum_{d|n} Moebius(n/d)*d^(b-1) for b = 4.at n=25A160892
• Odd almost practical numbers.at n=35A174535
• Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors.at n=29A188439
• Principal diagonal of the convolution array A213548.at n=13A213549
• Odd numbers in A192274.at n=30A243104
• Odd numbers k such that the product of factorials of proper divisors of k does not divide k!at n=33A248694
• Index of record values in A247190.at n=38A250985
• Irregular triangle read by rows where row n lists all odd primitive abundant numbers with n prime factors, counted with multiplicity.at n=25A287646
• G.f. A(x) = Sum_{n>=0} x^n/a(n) satisfies: A(x) = A(x^2) + Integral A(x^2) dx.at n=61A294640
• G.f. A(x) = Sum_{n>=0} x^n/a(n) satisfies: A(x) = A(x^2) + Integral A(x^2) dx.at n=122A294640