32400

Appears in sequences

• a(n) = 2*(a(n-1) + (n-1)*a(n-2)) for n >= 2 with a(0) = 1.at n=8A000898
• a(n) = (prime(n) - 1)^2.at n=41A005722
• a(n) = 10*n^3 - 6*n^2.at n=15A006592
• The minimal numbers: sequence A005179 arranged in increasing order.at n=47A007416
• Squares whose sum of divisors is a square.at n=3A008848
• a(n) = Product_{j=0..5} floor((n+j)/6).at n=34A008881
• [ n(n-1)(n-2)(n-3)/13 ].at n=27A011923
• Triangle read by rows, the inverse Bell transform of n!*binomial(5,n) (without column 0).at n=17A013988
• a(n) = (5*n)^2.at n=36A016850
• a(n) = (6*n)^2.at n=30A016910
• a(n) = (7*n + 5)^2.at n=25A017042
• a(n) = (8*n + 4)^2.at n=22A017114
• a(n) = (9*n)^2.at n=20A017162
• a(n) = (10*n)^2.at n=18A017270
• a(n) = (11*n + 4)^2.at n=16A017438
• a(n) = (12*n)^2.at n=15A017522
• Squares which are a decimal concatenation of two or more squares.at n=41A019547
• Numbers of form 5^i*6^j, with i, j >= 0.at n=25A025622
• Square refactorable numbers.at n=28A036907
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*6^j.at n=19A038248