39000

Appears in sequences

• Expansion of (1-25*x)^(-8/5).at n=3A049396
• a(n)=Sum_{d|n} d*numbpart(d), where numbpart(d)=number of partitions of d, cf. A000041.at n=23A061259
• Number of atoms in first n shells of type I hyperfullerene.at n=12A063497
• Least number beginning with n such that every partial sum is a square.at n=38A095158
• Triangle, read by rows, where T(n,k) = A049020([n/2],k)*A049020([(n+1)/2],k).at n=39A124526
• Row sums of triangle A129503.at n=41A129504
• Numbers m that raised to the powers from 1 to k (with k>=1) are multiples of the sum of their digits (m raised to k+1 must not be a multiple). Case k=17.at n=1A135202
• Number of 7 X 7 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=19A156392
• Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 19.at n=4A156471
• Numbers with prime factorization p*q*r^3*s^3 (where p, q, r, s are distinct primes).at n=16A190108
• Expansion of ( f(-q)^12 + 22 * q * f(-q)^6 * f(-q^5)^6 + 125 * q^2 * f(-q^5)^12 ) / (f(-q) * f(-q^5))^2 in powers of q where f() is a Ramanujan theta function.at n=15A235870
• a(n) = 25^(n+1)*Gamma(n+8/5)/Gamma(3/5).at n=2A276489
• A multiplicative encoding for the exponents of 2 obtained when using Shevelev's algorithm for computing A002326.at n=27A292239
• List of numbers whose middle Fibonomial coefficient (2n,n)_F is prime to 105.at n=11A295562
• a(n) = n * sigma_2(n).at n=29A328259
• Table T(n,k) read by upward antidiagonals. T(n,k) = Product_{i=1..n} Sum_{j=1..k} (i-1)*k+j.at n=25A333445