|
%I #3 Mar 31 2012 12:35:46
%S 0,1,2,6,13,23,36,62,78,123,150,238,255,355,427,567,580,864,810,1202,
%T 1232,1471,1452,2310,1960,2479,2712,3414,2947,4649,3600,5126,5022,
%U 5673,5845,8457,6165,7975,8405,11062,8410,13133,9702,13726,14475,14323,12696
%N Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1
%C Column 2 of A180782
%H R. H. Hardin, <a href="/A180773/b180773.txt">Table of n, a(n) for n=1..999</a>
%e Solutions for sum of products of 2 1..5 pairs = 0 (mod 6) are
%e (1*1 + 1*5) (1*2 + 1*4) (1*2 + 2*2) (1*2 + 2*5) (1*2 + 4*4) (1*3 + 1*3)
%e (1*3 + 3*3) (1*3 + 3*5) (1*4 + 2*4) (1*4 + 4*5) (1*5 + 5*5) (2*2 + 2*4)
%e (2*2 + 4*5) (2*3 + 2*3) (2*3 + 3*4) (2*4 + 2*5) (2*4 + 4*4) (2*5 + 4*5)
%e (3*3 + 3*3) (3*3 + 3*5) (3*4 + 3*4) (3*5 + 3*5) (4*4 + 4*5)
%K nonn
%O 1,3
%A _R. H. Hardin_ Sep 20 2010
|
