OFFSET
1,1
COMMENTS
Read A001045 term-by-term, factorize each term, write down any primes not seen before.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..3915
Graham Everest, Shaun Stevens, Duncan Tamsett and Tom Ward, Primes generated by recurrence sequences, Amer. Math. Monthly, 114 (No. 5, 2007), 417-431.
K. Zsigmondy, Zur Theorie der Potenzreste, Monatsh. Math., 3 (1892), 265-284.
MAPLE
concat := (a, h)->[op(a), op(sort(convert(h, list)))]:
PPDinOrder := proc(S) local A, H, T, s;
T := {0, 1}; A := [];
for s in S do
H := numtheory[factorset](s) minus T:
if H <> {} then
A := concat(A, H);
T := T union H
fi
od;
A end:
# Peter Luschny, Jan 04 2011
MATHEMATICA
DeleteDuplicates[Flatten[FactorInteger[#][[All, 1]]&/@LinearRecurrence[ {1, 2}, {3, 5}, 50]]](* Harvey P. Dale, Apr 14 2020 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 13 2007
STATUS
approved