|
Search: id:A155898
|
|
|
| A155898 |
|
Square matrix T(m,n)=1 if (2m+1)^(2n)-2 is prime, 0 otherwise; read by antidiagonals. |
|
+0
1
|
|
| 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 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, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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 even powers are considered (which obviously correspond to an odd power of the base squared).
|
|
PROGRAM
|
(PARI) T = matrix( 19, 19, m, n, isprime((2*m+1)^(2*n)-2)) ;
A155898 = 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: A156241 A156254 A010056 this_sequence A115952 A115524 A117198
Adjacent sequences: A155895 A155896 A155897 this_sequence A155899 A155900 A155901
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
M. F. Hasler (MHasler(AT)univ-ag.fr), Feb 01 2009
|
|
|
Search completed in 0.002 seconds
|
