A180793 T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 1..n-1.
0, 0, 1, 0, 0, 2, 0, 1, 1, 2, 0, 0, 3, 4, 3, 0, 1, 7, 14, 9, 2, 0, 0, 5, 30, 46, 19, 4, 0, 1, 9, 64, 142, 106, 31, 4, 0, 0, 15, 112, 400, 502, 254, 42, 4, 0, 1, 12, 198, 1004, 1914, 1519, 494, 75, 3, 0, 0, 18, 318, 2282, 6404, 7589, 3828, 939, 91, 6, 0, 1, 26, 502, 4868, 19300
Offset: 1
Links
- R. H. Hardin, Table of n, a(n) for n=1..2016
Comments