|
| |
|
|
A096451
|
|
Primes p such that the number of primes less than p equal to 1 mod 4 is two less than the number of primes less than p equal to 3 mod 4.
|
|
1
|
|
|
|
13, 29, 37, 53, 61, 71, 79, 101, 107, 113, 131, 139, 151, 163, 199, 359, 409, 421, 433, 443, 457, 479, 1223, 1231, 1249, 1277, 1283, 1291, 1301, 1307, 1399, 1423, 1439, 8699, 8779, 26821, 26951, 26959, 26987, 27011, 27031, 615731, 615869, 615887
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
First term prime(2) = 3 is placed on 0-th row.
If prime(n-1) = +1 mod 4 is on k-th row then we put prime(n) on (k-1)-st row.
If prime(n-1) = -1 mod 4 is on k-th row then we put prime(n) on (k+1)-st row.
This process makes an array of prime numbers:
3, 7, 19, 43, ....0-th row
5, 11, 17, 23, 31, 41, 47, 59, 67, 103, 127, ....first row
13, 29, 37, 53, 61, 71, 79, 101, 107, 113 ....2nd row
73, 83, 97, 109, ....3rd row
89, ....4-th row
|
|
|
LINKS
|
Table of n, a(n) for n=1..44.
|
|
|
CROSSREFS
|
Cf. A096447-A096455.
Cf. A096447-A096455.
Sequence in context: A158075 A087594 A088909 * A090690 A160026 A141555
Adjacent sequences: A096448 A096449 A096450 * A096452 A096453 A096454
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Aug 12 2004
|
|
|
EXTENSIONS
|
More terms from Joshua Zucker, May 03 2006
|
|
|
STATUS
|
approved
|
| |
|
|
