LINKS
Amiram Eldar, <a href="/A129738/b129738_1.txt">Table of n, a(n) for n = 1..3915</a>
The OEIS is supported by the many generous donors to the OEIS Foundation.
Amiram Eldar, <a href="/A129738/b129738_1.txt">Table of n, a(n) for n = 1..3915</a>
editing
approved
t = Flatten[Table[First/@FactorInteger[(2^n-(-1)^n)/3], {n, 3, 100}]]; t2 = {}; Do[If[! MemberQ[t2, i], AppendTo[t2, i]], {i, t}]; t2 (* Vladimir Joseph Stephan Orlovsky, Feb 05 2012 *)
reviewed
editing
proposed
reviewed
editing
proposed
G. Graham Everest et al., , Shaun Stevens, Duncan Tamsett and Tom Ward, <a href="http://www.jstor.org/stable/27642221">Primes generated by recurrence sequences</a>, Amer. Math. Monthly, 114 (No. 5, 2007), 417-431.
Amiram Eldar, <a href="/A129738/b129738_1.txt">Table of n, a(n) for n = 1..3915</a>
approved
editing
editing
approved
Drop[DeleteDuplicates[Flatten[FactorInteger[#][[All, 1]]&/@ LinearRecurrence[ {1, 2}, {0, 13, 5}, 50]]], 2] (* Harvey P. Dale, Apr 14 2020 *)
approved
editing
editing
approved