A332301 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest divisor of the sum of the previous two terms that has not yet appeared. If all divisors have appeared then a(n) equals the sum.
1, 2, 3, 5, 4, 9, 13, 11, 6, 17, 23, 8, 31, 39, 7, 46, 53, 33, 43, 19, 62, 27, 89, 29, 59, 22, 81, 103, 92, 15, 107, 61, 12, 73, 85, 79, 41, 10, 51, 61, 14, 25, 39, 16, 55, 71, 18, 89, 107, 28, 45, 73, 118, 191, 309, 20, 47, 67, 38, 21, 59, 40, 99, 139, 34, 173, 69, 121, 95, 24, 119, 143, 131, 137, 134, 271, 135, 58, 193
Offset: 1
Keywords
Examples
a(5) = 4 as a(3) + a(4) = 3 + 5 = 8, and the divisors of 8 are 1,2,4,8. 1 and 2 have already appeared so 4 is the least divisor not yet in the sequence. a(40) = 61 as a(38) + a(39) = 10 + 51 = 61. The divisors of 61 are 1 and 61, both of which have already appeared, at a(1) and a(32), thus a(40) = 61. Note that as a(31) and a(39) differ a(33) and a(41) differ and the sequence does not repeat.
Comments