1,1

These primes are nearly like the 2^n-1 primes.

a(n) = If [ Mod[A001591[n], 1]=1 then A001591[n] else A001591[n]+1 If PrimeQ[a[n]]==True then a[n]

Clear[m] NSolve[x^5-x^4-x^3-x^2-x-1==0, x] k=1.96594823664548545 q=k^2-k-1/k-1/k^2-1/k^3 m0={{0, 1, 0, 0, 0}, {0, 0, 1, 0, 0}, {0, 0, 0, 1, 0}, {0, 0, 0, 0, 1}, {1, 1, 1, 1, q}} m[n_]=MatrixPower[m0, n]; a=Table[If[Mod[Floor[Re[m[n][[5, 5]]]], 2]==1, Floor[Re[m[n][[5, 5]]]], Floor[Re[m[n][[5, 5]]]]+1], {n, 1, digits}]; b=Table[If[PrimeQ[a[[n]]]==True, a[[n]], 0], {n, 1, digits}] c=Delete[Union[b], 1]

Cf. A001591.

Sequence in context: A113169 A079496 A038898 this_sequence A103149 A007802 A056816

Adjacent sequences: A089130 A089131 A089132 this_sequence A089134 A089135 A089136

nonn,uned

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Dec 05 2003