4311744512
domain: N
Appears in sequences
- S(n; 1,0) = S(n; 3,0) 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=17A068786
- Number of strings over Z_4 of length n with trace 1 and subtrace 2.at n=17A068787
- Number of solutions to Sum_{i=1..n} x_i^2 == 0 (mod 4) with x_i in 0..3.at n=16A228920
- Number of solutions to Sum_{i=1..n} x_i^2 == 1 (mod 4) with x_i in 0..3.at n=16A229136
- a(n) = n^8 * Product_{p|n, p prime} (1 + 1/p^8).at n=15A351303