82656
domain: N
Appears in sequences
- Number of colorings of labeled graphs on n nodes using exactly 2 colors, divided by 4.at n=6A000683
- Kaprekar numbers: positive numbers n such that n = q+r and n^2 = q*10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n != 10^a, a >= 1.at n=21A006886
- Kaprekar numbers: numbers k such that k = q + r and k^2 = q*10^m + r, for some m >= 1, q >= 0 and 0 <= r < 10^m. Here q and r must both have the same number of digits.at n=10A045913
- The full list of 5-Kaprekar numbers.at n=5A053396
- Another version of the Kaprekar numbers (A006886): n such that n = q+r and n^2 = q*10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n != 10^a, a >= 1 and n an m-digit number.at n=18A053816
- Triangle T(n,k) = C_n(k)/2^(k*(k-1)/2) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1 <= k <= n).at n=22A058875
- Number of 8X8 arrays of squares of integers, symmetric under 90 degree rotation, with all rows summing to n.at n=31A156397
- Kaprekar numbers, allowing powers of 10: n such that n=q+r and n^2=q*10^m+r, for some m >= 1, q>=0 and 0<=r<10^m.at n=25A248353
- Expansion of elliptic_K / elliptic_E in powers of q.at n=10A261976
- a(n) = 81*n^2 - 9*n.at n=32A277991
- Number of n X 2 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=7A281534
- T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=37A281540
- T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=43A281540
- Square roots of terms in A238237.at n=12A290449
- a(n) = n^3 + (1/n) * Sum_{k=1..n-1} binomial(n,k) * k * a(k) * (n-k)^3.at n=5A336184
- Numbers k >= 1 such that A018804(k) divided by A000203(k) is an integer.at n=30A349726
- Number of chordless cycles (of length > 3) in the complement of the n-hypercube graph.at n=7A364370
- Oblong numbers that are products of smaller oblong numbers.at n=25A374374