A155899 -id:A155899 - cp's OEIS frontend

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

0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0

Offset: 1

Graph
List
Refs
Listen
History
Text
Internal format

M. F. Hasler, Feb 01 2009

easy
nonn
tabl

In some sense a "minimal" possible generalization of the pattern of Mersenne primes (cf. A000043) is to consider powers of odd numbers (> 1) minus 2. Since even powers obviously correspond to an odd power of the base squared, it is sufficient to consider only odd powers, cf. A155899.

Cf. A084714, A128472, A094786, A014224, A109080, A090669, A128455, A128457, A128458, A128459, A128460, A128461.

T = matrix( 19,19,m,n, isprime((2*m+1)^n-2)) ;
A155897 = concat( vector( vecmin( matsize(T)), i, vector( i, j, T[j,i-j+1])))

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI