|
%I #50 Aug 26 2015 00:32:28
%S 2,5,7,13,17,29,53,89,199,271,349,823,1747,2251,2593,6569,7121,27479,
%T 44129,85361,115259,254731,462103,903751
%N a(1)=2; thereafter a(n) is the smallest prime > a(n-1) that is not a factor of any 1+A, where A is a product of one or more distinct earlier terms.
%H Anders Hellström, <a href="/A260388/a260388_1.txt">Ruby program</a>
%t L={2}; While[Length@L < 15, s= LCM@@ (1 + Times @@@ Subsets[L]); p = NextPrime@ L[[-1]]; While[ Mod[s, p] == 0, p = NextPrime@ p]; AppendTo[L, p]]; L (* inefficient, _Giovanni Resta_, Aug 19 2015 *)
%K nonn,hard,more
%O 1,1
%A _Anders Hellström_, Aug 18 2015
%E a(14)-a(24) from _Giovanni Resta_, Aug 19 2015
|
