A155899 Square matrix T(m,n)=1 if (2m+1)^(2n-1)-2 is prime, 0 otherwise; read by antidiagonals.

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

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.

Links

Table of n, a(n) for n=1..105.

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: A269723 A284487 A156660 * A284932 A117814 A257000

Adjacent sequences: A155896 A155897 A155898 * A155900 A155901 A155902

Keyword

easy,nonn,tabl

Author

M. F. Hasler, Feb 01 2009

Status

approved