[seqfan] A question about A256964

[Ali Sada]

Hi everyone,
I was trying the algorithm below and found out that it was already an OEIS sequence (A256964.)
a(1) = 1, a(2) =2. Take a list of positive integers starting with 3. Replace each term in the list, L(i), with L(L(i)+i). a(i) = L(i). 
3,4,5,6,7,8,9,10,11,12,13,14,15,16,17Replace 3 with 6, a(1) = 6.Replace 4 with 8, a(2) = 8.Replace 5 with 10, a(3) =10Now 3 comes again and we replace it with 9, a(4) =9. And so on. 
To explain further, this is the VBA program I used 
 
For i =3 to 300 
    x = Cells(i, 1)    Cells(i, 1) = Cells(i + x, 1)
    Cells(i + x, 1) = x
Next i

1, 2, 6, 8, 10, 9, 14, 12, 4, 15, 22, 5, 26, 21, 18, 32, 34,7, 38, 40, 24, 33, 46, 27, 50, 39, 30, 56, 58, 11, 62, 48, 36, 51, 70, 13, 74, 57,42, 60, 82, 45, 86, 88, 16, 69, 94, 17, 98, 75, 54, 104, 106, 19, 110, 84, 20, 87,118, 63, 122, 93, 66, 128, 130, 23, 134, 136, 72, 105, 142, 25, 146, 111, 78, 152,154, 81, 158, 160, 28, 123, 166, 29, 170, 129, 90, 132, 178, 31, 182, 184, 96, 141,190, 99, 194, 147, 102, 200, 202, 35, 206, 156, 108, 159, 214, 37, 218, 165, 114,224, 226, 117, 230, 232, 120, 177, 238, 41, 242, 183, 126, 248, 250, 43, 254, 192,44, 195, 262, 135, 266, 201, 138, 204, 274, 47, 278, 280, 144, 213, 286, 49, 290,219, 150, 296, 298, 153, 302, 228, 52, 231, 310, 53, 314, 237, 162

I'm not sure if this is worthy of a comment. 

Best,
Ali