|
|
A267438
|
|
Abatzoglou-Silverberg-Sutherland-Wong primes: primes in A267437.
|
|
3
|
|
|
11, 23, 67, 151, 487, 2039, 4211, 524087, 1046579, 1073691427, 1099510801043, 2251799727348791, 36028797132202711, 4611686014335996451, 36893488155919083943, 147573952565445262007, 604462909807989625559191, 77371252455344850805618531, 618970019642688992452665703, 5070602400912917643802528801507
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Abatzoglou, Silverberg, Sutherland, & Wong give a quasi-quadratic algorithm for determining membership in this sequence.
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[RecurrenceTable[{a[n] == 4 a[n - 1] - 7 a[n - 2] + 8 a[n - 3] - 4 a[n - 4], a[2] == 11, a[3] == 23, a[4] == 67, a[5] == 151}, a, {n, 2, 100}], PrimeQ] (* Michael De Vlieger, Jan 24 2016 *)
|
|
PROG
|
(PARI) A267437(n)=([0, 1, 0, 0; 0, 0, 1, 0; 0, 0, 0, 1; -4, 8, -7, 4]^n*[11; 11; 23; 67])[1, 1]
list(lim)=my(v=List(), t, n); while((t=A267437(n++))<=lim, if(ispseudoprime(t), listput(v, t))); Vec(v)
(PARI) See Greathouse link in A267439.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|