A360209 Lexicographically earliest infinite sequence of distinct positive numbers such that, for n > 2, a(n) shares a factor with a(n-2) + a(n-1) but shares no factor with a(n-2).

1, 2, 3, 5, 4, 6, 15, 7, 8, 9, 17, 10, 12, 11, 23, 14, 37, 27, 16, 43, 59, 18, 21, 13, 20, 22, 33, 25, 26, 24, 35, 295, 32, 36, 51, 29, 28, 19, 47, 30, 44, 259, 39, 34, 73, 107, 38, 40, 45, 119, 41, 46, 42, 55, 97, 48, 50, 49, 57, 52, 109, 63, 54, 65, 77, 56, 76, 69, 75, 58, 91, 149, 60, 66

Offset

1,2

Comments

To ensure the sequence is infinite another criterion must be satisfied when choosing a(n), namely a(n) + a(n-1) must contain a factor not in a(n-1). If this were not the case, a(n+1) = a(n) + a(n-1) would share a factor with both a(n) + a(n-1) and a(n-1), terminating the sequence.

In the first 100000 terms the fixed points for n > 2 are 3, 6, 441, 1677, 3629, 9701, 17131, although it is likely more exist. The sequence is conjectured to be a permutation of the positive integers.

Links

Table of n, a(n) for n=1..74.

Scott R. Shannon, Image for n=1..100000. The green line is a(n) = n.

Example

a(7) = 15 as a(5) + a(6) = 4 + 6 = 10, and 15 is the smallest positive unused number that shares a factor with 10 but not with a(5) = 4.
a(41) = 44 as a(39) + a(40) = 47 + 30 = 77, and 44 shares a factor with 77 but not with a(39) = 47. Note that 42 also satisfies these criteria but 30 + 42 = 72 which shares all its factors with a(40) = 30, thus setting a(41) = 42 would make it impossible to find a(42).

Crossrefs

Cf. A251604 (does not share with a(n-1)), A098550, A336957, A337136, A359557, A353239.

Sequence in context: A352943 A143514 A085180 * A114750 A234923 A145391

Adjacent sequences: A360206 A360207 A360208 * A360210 A360211 A360212

Keyword

nonn

Author

Scott R. Shannon, Jan 29 2023

Extensions

a(6) and above corrected by Scott R. Shannon, Mar 17 2023

Status

approved