3312400

Appears in sequences

• Squares of numbers in array formed from even elements to the right of middle of rows of Pascal triangle.at n=27A014762
• Squares of even pentagonal numbers.at n=17A014770
• a(1) = 7; for n > 0, a(n+1) = a(n) * sum of digits of a(n).at n=5A047899
• Smallest square k > 0 such that n*k + 1 is also a square or 0 if no such term exists, i.e., when n is a square.at n=28A069018
• Smallest square k > 1 such that n*k + 1 is also a square or 0 if no such term exists, i.e., when n is a square.at n=28A069019
• Numbers k such that the sum of factorials of the digits of k equals the sum of the primes from the smallest prime factor of k to the largest prime factor of k.at n=25A074256
• a(n) is the denominator of (Zeta(0,2,1/3) - Zeta(0,2,n+1/3)) where Zeta is the Hurwitz Zeta function.at n=5A173984
• Alternatively squares and cubes with prime differences.at n=40A186882
• Number of n X 6 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=12A208140
• a(n) = binomial(n+4, n)^2. Square of the fifth diagonal sequence of A007318 (Pascal). Fifth diagonal sequence of A008459.at n=12A288876
• Number of solutions to +- 1^3 +- 3^3 +- 5^3 +- 7^3 +- ... +- (4*n-1)^3 = 0.at n=21A292522
• a(n) is the number of subsets of {1..n} that contain 4 even and 4 odd numbers.at n=32A331575
• Square array read by ascending antidiagonals: T(n,k) = (2*k)!/k!^2 * ( (2*n*k)! * ((n + 2)*k)! )/( (n*k)! * ((n + 1)*k)!^2 ) for n, k > = 0.at n=25A364509
• a(n) = binomial(4*n, n)^2.at n=4A364510
• Primitives exponential abundant numbers that are not primitives exponential unitary abundant.at n=27A391086
• Primitive exponential Zumkeller numbers that are not primitive exponential unitary Zumkeller numbers.at n=29A391091