1952500
domain: N
Appears in sequences
- Number of strings of length n over Z_5 with trace 0 and subtrace 1.at n=10A073964
- Number of strings of length n over Z_5 with trace 0 and subtrace 2.at n=10A073965
- Number of strings of length n over Z_5 with trace 1 and subtrace 1.at n=10A073967
- Number of strings of length n over Z_5 with trace 1 and subtrace 2.at n=10A073968
- Number of strings of length n over Z_5 with trace 1 and subtrace 3.at n=10A073969
- Number of strings of length n over Z_5 with trace 1 and subtrace 4.at n=10A073970
- Number of elements of GF(5^n) with trace 0 and subtrace 1.at n=10A074007
- Number of elements of GF(5^n) with trace 0 and subtrace 2.at n=10A074008
- Number of elements of GF(5^n) with trace 1 and subtrace 1.at n=10A074010
- Number of elements of GF(5^n) with trace 1 and subtrace 2.at n=10A074011
- Number of elements of GF(5^n) with trace 1 and subtrace 3.at n=10A074012
- Number of elements of GF(5^n) with trace 1 and subtrace 4.at n=10A074013
- Array read by rows: T(n,k) is the number of solutions to the equation Sum_{i=1..n} x_i^2 == k (mod 5) with x_i in 0..4, where n >= 0 and 0 <= k <= 4.at n=51A330607
- Array read by rows: T(n,k) is the number of solutions to the equation Sum_{i=1..n} x_i^2 == k (mod 5) with x_i in 0..4, where n >= 0 and 0 <= k <= 4.at n=52A330607
- Array read by rows: T(n,k) is the number of solutions to the equation Sum_{i=1..n} x_i^2 == k (mod 5) with x_i in 0..4, where n >= 0 and 0 <= k <= 4.at n=53A330607
- Array read by rows: T(n,k) is the number of solutions to the equation Sum_{i=1..n} x_i^2 == k (mod 5) with x_i in 0..4, where n >= 0 and 0 <= k <= 4.at n=54A330607
- Numbers k such that A048675(sigma(k)) is equal to A048675(2*k).at n=34A331751