login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A132425
a(1)=1. a(2)=2. For n >= 3, a(n) is the smallest integer which is > a(n-1), is not coprime to a(n-1) and is such that a(n)-a(n-1) does not equal a(m)-a(m-1) for any m < n.
1
1, 2, 4, 8, 14, 21, 24, 32, 42, 51, 63, 77, 88, 104, 117, 132, 150, 155, 175, 196, 218, 242, 268, 296, 326, 358, 392, 427, 469, 518, 554, 592, 629, 646, 665, 690, 713, 744, 771, 804, 843, 888, 928, 957, 1001, 1053, 1101, 1152, 1198, 1248, 1302, 1358, 1416, 1473
OFFSET
1,2
COMMENTS
Is {a(n+1)-a(n)} a permutation of the positive integers?
MATHEMATICA
a = {1, 2}; For[n = 1, n < 1500, n++, n = a[[ -1]]; c = 0; While[c == 0, n++; If[GCD[n, a[[ -1]]] > 1, b = 0; For[j = 1, j < Length[a], j++, If[a[[j + 1]] - a[[j]] == n - a[[ -1]], b = 1]]; If[b == 0, AppendTo[a, n]; c = 1]]]]; a (* Stefan Steinerberger, Oct 21 2007 *)
CROSSREFS
Sequence in context: A190402 A175300 A316699 * A154264 A370141 A194694
KEYWORD
nonn
AUTHOR
Leroy Quet, Aug 20 2007
EXTENSIONS
More terms from Stefan Steinerberger, Oct 21 2007
STATUS
approved