|
| |
|
|
A155899
|
|
Square matrix T(m,n)=1 if (2m+1)^(2n-1)-2 is prime, 0 otherwise; read by antidiagonals.
|
|
2
| |
|
|
0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| In some sense the "minimal" possible generalization of the pattern of Mersenne primes (cf. A000043) is to consider powers of odd numbers minus 2. Here only odd powers are considered.
|
|
|
PROG
| (PARI) T = matrix( 19, 19, m, n, isprime((2*m+1)^(2*n-1)-2)) ;
A155899 = concat( vector( vecmin( matsize(T)), i, vector( i, j, T[j, i-j+1])))
|
|
|
CROSSREFS
| Cf. A084714, A128472, A014224, A109080, A090669, A128455, A128457, A128458, A128459, A128460, A128461.
Sequence in context: A132380 A021913 A156660 * A117814 A062301 A181712
Adjacent sequences: A155896 A155897 A155898 * A155900 A155901 A155902
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| M. F. Hasler (www.univ-ag.fr/~mhasler), Feb 01 2009
|
| |
|
|
