81250

Appears in sequences

• Sums of two distinct powers of 5.at n=26A038474
• Numbers k that divide 9^k + 7^k.at n=28A045605
• Sums of two powers of 5.at n=33A055237
• a(n) = ceiling(log(n)*2^n/n).at n=18A065615
• Numbers j that are the hypotenuse of exactly 16 distinct integer-sided right triangles, i.e., j^2 can be written as a sum of two squares in 16 ways.at n=2A097238
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (0, 1, 0), (1, -1, 0), (1, 1, -1)}.at n=11A148305
• Triangle S(n,k) by rows: coefficients of 5^((n-1)/2)*(x^(1/5)*d/dx)^n when n is odd, and of 5^(n/2)*(x^(4/5)*d/dx)^n when n is even.at n=39A223171
• Triangle S(n,k) by rows: coefficients of 5^((n-1)/2)*(x^(1/5)*d/dx)^n when n=1,3,5,...at n=19A223529
• Expansion of f(-x^2, -x^10) / f(-x, -x) in powers of x where f(, ) is Ramanujan's general theta function.at n=33A262984
• Numbers k such that k = a^2 + b^4 and n^2 = c^3 + d^5 for some positive integers a, b, c, d.at n=0A274033
• Number of nX2 0..1 arrays with no element equal to more than three of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=9A281159
• a(n) = Product_{k=0..n} (1 + n!/k!).at n=4A306193
• Numbers k that are a substring of k*(k-1).at n=28A316263
• Primitive integers for the number of ways k to write as a sum of two squares.at n=37A336542
• Consecutive states of the linear congruential pseudo-random number generator (3661*s + 30809) mod 145800 when started at s=1.at n=21A385365