A166092 - OEIS

A166092

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.

3, 7, 11, 15, 319, 19, 23, 607, 35, 415, 31, 703, 59, 1639, 91, 39, 895, 63, 2359, 175, 43, 47, 1063, 103, 3995, 575, 127, 51, 55, 1103, 131, 5191, 631, 295, 83, 67, 71, 1135, 251, 5459, 731, 635, 223, 115, 27, 79, 1447, 279, 7567, 1175, 659, 735, 139

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

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), ...

LINKS

A. Karttunen, Table of n, a(n) for n = 0..10010

EXAMPLE

The top left corner of the array:

3, 7, 15, 23, 31, 39, ...

11, 319, 607, 703, 895, 1063, ...

19, 35, 59, 63, 103, 131, ...

415, 1639, 2359, 3995, 5191, 5459, ...

91, 175, 575, 631, 731, 1175, ...

CROSSREFS

a(n) = A004767(A166091(n)). The leftmost column: A166096. The first five rows: A165469, A166053, A166055, A166057, A166059. Cf. also A112070.

Sequence in context: A145052 A100900 A117829 * A375053 A184913 A307761

Adjacent sequences: A166089 A166090 A166091 * A166093 A166094 A166095

KEYWORD

nonn,tabl

AUTHOR

Antti Karttunen, Oct 08 2009

STATUS

approved