68853694464
domain: N
Appears in sequences
- S(n; 0,1) = S(n; 2,3) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=19A068711
- S(n; 0,3) = S(n; 2,1) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=19A068777
- Number of solutions to Sum_{i=1..n} x_i^2 == 1 (mod 4) with x_i in 0..3.at n=18A229136
- a(n) = n^9 * Product_{p|n, p prime} (1 + 1/p^9).at n=15A351304