A356255 a(1) = 1; for n > 1, a(n) is the smallest magnitude number not occurring earlier such that n is divisible by s = Sum_{k = 1..n} a(k), where |s| > 1.
1, -3, -1, 5, 3, -2, 4, -5, 7, -4, 6, -7, 9, -6, 8, -11, 13, -8, 10, -9, 11, -10, 12, -15, -13, 18, 14, -20, 22, -14, 16, -23, -19, 28, -12, -17, -25, 35, 15, -18, -36, 20, -22, 21, 17, -41, 93, -31, 33, -24, 26, -38, 40, -26, -16, -39, 25, 32, 30, -29, 31, -30, -28, 29, -27, 61, -133, 50, -52, 34
Offset: 1
Examples
a(7) = 4 as Sum_{k = 1..7} a(k) = 1 - 3 - 1 + 5 + 3 - 2 + 4 = 7, and 4 is the smallest magnitude number not occurring earlier that forms a sum with magnitude > 1 that is a divisor of 7.
Links
- Scott R. Shannon, Table of n, a(n) for n = 1..2020
Comments