52432
domain: N
Appears in sequences
- Number of subsets of {1,2,...,n} which sum to 0 modulo n.at n=19A063776
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 5.at n=18A068011
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 10.at n=19A068031
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 20.at n=20A068041
- Numbers k such that A003313(k) = A003313(5*k).at n=16A116460
- a(n) = A061039(8*n+5).at n=28A144453
- a(n) = Sum_{k<=n} A007955(k) * A000027(n-k+1) = Sum_{k<=n} A007955(k) * (n-k+1), where A007955(m) = product of divisors of m.at n=19A174934
- Number of 5-step king's tours on an n X n board summed over all starting positions.at n=6A186864
- Number of n X 5 binary arrays without the pattern 0 1 diagonally or antidiagonally.at n=28A188820
- Number of solutions to 1 +- 2 +- 3 +- ... +- n == 0 (mod n).at n=19A300190
- Number of solutions to 1 +- 3 +- 5 +- ... +- (2*n-1) == 0 mod n.at n=19A300218
- Number of solutions to 1 +- 8 +- 27 +- ... +- n^3 == 0 (mod n).at n=19A300269
- G.f. A(x) satisfies A(x) = 1 / (1 - x - x^3 * A(x^3)).at n=26A367667