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
Offset: 0
Examples
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, ...
Links
- A. Karttunen, Table of n, a(n) for n = 0..10010
Comments