|
|
A229626
|
|
a(n) is the smallest m such that 2*m^k-1 is prime for k = 1, 2, ..., n.
|
|
3
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
a[1]=2; a[n_]:=a[n]=(For[m=a[n-1], Union[Table[PrimeQ[2 m^k-1], {k, n}]]!={True}, m++]; m)
|
|
PROG
|
(PARI) a(n)=my(m=2); while(1, for(k=1, n, if(!ispseudoprime(2*m^k-1), m++; next(2))); return(m)) \\ Charles R Greathouse IV, Oct 01 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|