19531250

Appears in sequences

• Hadamard maximal determinant problem: largest determinant of a (real) {0,1}-matrix of order n.at n=19A003432
• Numbers that are the sum of 2 nonzero 10th powers.at n=14A004802
• Numbers that are the sum of at most 2 nonzero 10th powers.at n=20A004897
• Expansion of (1-3*x)/(1-5*x).at n=11A020699
• Pisot sequences E(2,10), L(2,10), P(2,10), T(2,10).at n=10A020729
• a(n) = 5*a(n-2), starting 1,2.at n=21A026383
• a(n) = 5*a(n-2), starting 1,2,4.at n=21A026395
• a(n) = Sum_{k=0..n} (k+1) * T(n,k), with T given by A026374.at n=18A026950
• a(n) = n*5^(n-1).at n=10A053464
• Numbers k such that k | 12^k + 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k.at n=40A057491
• Maximum of |det(A)| where A is an n X n circulant (0,1) matrix over the integers.at n=18A086432
• Numbers n such that n-th Pisano number = 6*n.at n=10A095687
• a(3*n) = 3*a(3*n-1)-3*a(3*n-2)+2*a(3*n-3), a(3*n+1) = 3*a(3*n)-3*a(3*n-1)+2*a(3*n-2), a(3*n+2) = 3*a(3*n+1)-3*a(3*n) with a(0)=1, a(1)=2, a(2)=3.at n=31A133335
• Denominator of Euler(n, 1/25).at n=5A156965
• a(n) = 5*a(n-2) for n > 2; a(1) = 2, a(2) = 5.at n=20A162963
• Numbers of circuits of length 2n in K_{n,n} (the complete bipartite graph on 2n vertices).at n=4A172286
• Numbers k such that phi(tau(k)) = rad(k).at n=13A173617
• n^(p1) + n^(p2) + n^(p3) + ... where (p1)*(p2)*(p3)*.... is the prime factorization of n (with multiplicity).at n=24A239283
• Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n^n as Sum(k=0..n)T(n,k)*binomial(n,k).at n=60A244120
• Numbers k such that the k-th cyclotomic polynomial has a root mod 5.at n=31A245478