|
%I #3 Mar 31 2012 13:21:20
%S 3,7,11,15,319,19,23,607,35,415,31,703,59,1639,91,39,895,63,2359,175,
%T 43,47,1063,103,3995,575,127,51,55,1103,131,5191,631,295,83,67,71,
%U 1135,251,5459,731,635,223,115,27,79,1447,279,7567,1175,659,735,139
%N Integers (all of the form 4k+3) organized into an array based on the number of times Sum_{i=1..u} J(i,4k+3) obtains value zero when u ranges from 1 to (4k+3), where J(i,k) is the Jacobi symbol.
%C Note: these are all of the form 4k+3, but still this is not permutation of A004767 (for the reason explained in A166091). Sequence A165603 gives the 4k+3 integers missing from this table.This square array A(row>=0, col>=0) is listed antidiagonally as A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), ...
%H A. Karttunen, <a href="/A166092/b166092.txt">Table of n, a(n) for n = 0..10010</a>
%e The top left corner of the array:
%e 3, 7, 15, 23, 31, 39, ...
%e 11, 319, 607, 703, 895, 1063, ...
%e 19, 35, 59, 63, 103, 131, ...
%e 415, 1639, 2359, 3995, 5191, 5459, ...
%e 91, 175, 575, 631, 731, 1175, ...
%Y a(n) = A004767(A166091(n)). The leftmost column: A166096. The first five rows: A165469, A166053, A166055, A166057, A166059. Cf. also A112070.
%K nonn,tabl
%O 0,1
%A _Antti Karttunen_, Oct 08 2009
|
