OFFSET
1,2
COMMENTS
Start on a(1) = 1 and underline it;
from there, jump over 1 term to the right; you land on a(3) = 2, which you underline;
from there, jump over 2 terms to the right; you'll land on a(6) = 2, which you underline;
from there, jump over 2 terms to the right; you'll land on a(9) = 3, which you underline;
from there, jump over 3 terms to the right; you'll land on a(13) = 3, which you underline;
from there, jump over 3 terms to the right; you'll land on a(17) = 2, which you underline; etc.
The underlined terms reproduce the starting sequence. The not underlined terms are the successive terms of the starting sequence augmented by 1.
LINKS
Dominic McCarty, Table of n, a(n) for n = 1..10000
PROG
(Python)
terms = 20
a, u, i, j, n = {0:1}, {0}, 0, 0, 0
while n < terms:
n += 2 if n+1 in u else 1
a[n], k, j = a[i]+1, a[i]+i+1, j+1
a[k], i = a[j], k
u.add(k)
print([a[n] for n in range(terms)]) # Dominic McCarty, Mar 31 2025
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Eric Angelini, Dec 22 2019
EXTENSIONS
More terms from Dominic McCarty, Mar 31 2025
STATUS
approved
