|
Search: id:A092556
|
|
|
| A092556 |
|
Triangle read by rows: T(1,1) = 1; for n>=2, write the first n^2 integers in an n X n array beginning with 1 in the upper left proceeding left to right and top to bottom; then T(n,k) is the first prime in the k-th row. |
|
+0
4
|
|
| 1, 2, 3, 2, 5, 7, 2, 5, 11, 13, 2, 7, 11, 17, 23, 2, 7, 13, 19, 29, 31, 2, 11, 17, 23, 29, 37, 43, 2, 11, 17, 29, 37, 41, 53, 59, 2, 11, 19, 29, 37, 47, 59, 67, 73, 2, 11, 23, 31, 41, 53, 61, 71, 83, 97, 2, 13, 23, 37, 47, 59, 67, 79, 89, 101, 113, 2, 13, 29, 37, 53, 61, 73, 89, 97, 109
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
There is a prime in each row.
|
|
REFERENCES
|
Paulo Ribenboim, "The Little Book Of Big Primes," Springer-Verlag, NY 1991, page 185.
|
|
MATHEMATICA
|
NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; Table[ NextPrim[i*n], {n, 2, 12}, {i, 0, n - 1}]
|
|
CROSSREFS
|
Cf. A092557, A083415.
Sequence in context: A097448 A133684 A025473 this_sequence A092550 A058977 A085818
Adjacent sequences: A092553 A092554 A092555 this_sequence A092557 A092558 A092559
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 27 2004
|
|
|
Search completed in 0.002 seconds
|
