A180782 T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1.
0, 0, 0, 0, 1, 0, 0, 0, 2, 1, 0, 1, 5, 6, 0, 0, 0, 3, 14, 13, 2, 0, 1, 7, 34, 42, 23, 0, 0, 0, 12, 62, 145, 119, 36, 3, 0, 1, 9, 118, 402, 522, 253, 62, 3, 0, 0, 15, 198, 995, 1960, 1518, 526, 78, 4, 0, 1, 22, 327, 2294, 6518, 7587, 4041, 944, 123, 0, 0, 0, 18, 499, 4856, 19467, 32893
Offset: 1
Links
- R. H. Hardin, Table of n, a(n) for n=1..2016
Comments