126025

Appears in sequences

• a(n) = (10*n + 5)^2.at n=35A017330
• a(n) = (11*n + 3)^2.at n=32A017426
• a(n) = (12*n + 7)^2.at n=29A017606
• Number of ordered factorizations with 3 levels of parentheses indexed by prime signatures: A050358(A025487(n)).at n=26A050359
• Squares of the form 2*prime(n) - prime(n+1).at n=36A110970
• Squares of tribonacci numbers A000213.at n=11A141583
• Number of n X n toroidal 0..2 arrays with each element having the sum of its vertical neighbors equal to the sum of its horizontal neighbors.at n=7A184098
• Expansion of e.g.f.: exp(16*x/(1-x)) / sqrt(1-x^2).at n=4A202878
• Number of n X 6 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=7A207597
• Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 0 1 vertically.at n=7A208035
• Squares which are a decimal concatenation of triprimes.at n=20A225151
• Perfect powers equal to the sum of 6 factorial numbers.at n=38A227647
• a(n) = index of first n in A262680; positions of records in A262680.at n=7A262687
• Square numbers of the form prime(k) + 2*prime(k+1).at n=13A284057
• a(n) = (p1 + p2)/36 such that p1 >= 5 and p2 = p1 + 2 are twin primes and p1 + p2 is a k-th power with k > 1.at n=41A330978
• Odd numbers k such that A064989(sigma(k)) >= k.at n=40A337344
• a(n) is the least k such that phi(k) + d(k) = A357916(n), where phi(k) = A000010(k) is Euler's totient function, and d(k) = A000005(k) is the number of divisors of k.at n=41A357917