login
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.
3
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,2
COMMENTS
This sequence uses the same rules as A085947 except that the restriction of all entries being unique is removed. The first term to repeat is 61 which appears at a(32) and then again at a(40). But in this case as a(31) and a(39) are different the sequence does not form a repeating loop of values. In fact it is easy to show the sequence can never form a repeating loop. If it did it would imply there is a first value A such that the sequence would be of the form ...,A,B,C,D,...,X,Y,A,B,C,D,...,X,Y,A,B,C,... . As the terms in the repeating loop are unchanging it implies every term's divisors have been previously seen, and thus A+B=C and B+C=D and so on, and thus each term in the loop is larger than the previous term. But that leads to a contradiction as from the first loop X and Y are larger than A, but the beginning of the second loop implies X+Y=A. Thus no unchanging series of repeated terms can exist.
In the first 1 million terms the largest value is a(895234) = 25216687, the lowest unseen value is 69006, and the value seen the most frequently is 618083, which occurs six times.
EXAMPLE
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.
CROSSREFS
Sequence in context: A353082 A085947 A328444 * A360281 A069202 A359874
KEYWORD
nonn
AUTHOR
Scott R. Shannon, Feb 09 2020
STATUS
approved