%I #6 Apr 20 2013 04:48:49

%S 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,

%T 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,

%U 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

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

%C 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.

%o (PARI) T = matrix( 19,19,m,n, isprime((2*m+1)^(2*n-1)-2)) ;

%o A155899 = concat( vector( vecmin( matsize(T)), i, vector( i, j, T[j,i-j+1])))

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

%K easy,nonn,tabl

%O 1,1

%A _M. F. Hasler_, Feb 01 2009