reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Ivan Neretin, <a href="/A026431/b026431.txt">Table of n, a(n) for n = 1..1000</a>
a = {1, 2}; used = {a[[1]]*a[[2]] - 1}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; used = Union[used, k*a - 1]; AppendTo[a, k], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)
approved
editing
Clark Kimberling (ck6(AT)evansville.edu)
nonn,new
nonn
Clark Kimberling, (ck6(AT)evansville.edu)
nonn,new
nonn
Clark Kimberling, ck6@cedar.(AT)evansville.edu
a(n) = least positive integer > a(n-1) and not a(i)*a(j)-1 for 1<=i<j<=n.
1, 2, 3, 4, 6, 8, 9, 10, 12, 13, 14, 16, 18, 20, 21, 22, 24, 28, 30, 32, 33, 34, 36, 37, 40, 42, 44, 45, 46, 48, 49, 50, 52, 54, 56, 57, 58, 60, 61, 64, 66, 68, 69, 70, 72, 74, 75, 76, 78, 80, 81, 82, 84, 85, 86, 88, 90, 92, 93, 94
1,2
nonn
Clark Kimberling, ck6@cedar.evansville.edu
approved