OFFSET
1,3
COMMENTS
For clarification: We start at the term with index a(n-1). From each term at index i, we can jump to up to two locations, which are a(i) terms away in either direction. We continue this process from the terms we have reached until we have visited all possible terms.
LINKS
Samuel Harkness, Table of n, a(n) for n = 1..10000
EXAMPLE
We find a(8)=4 by first looking at the previous term in the sequence so far (1,1,2,3,3,4,5), which is a(7)=5. This tells us to start at location i=5. Permitted steps can reach 4 locations as follows:
1, 1, 2, 3, 3, 4, 5
1<-------3
1, 1, 2, 3, 3, 4, 5
1<-1->2
Steps from each of these locations cannot reach anything new, so a(8)=4. The reachable terms are:
1, 1, 2, 3, 3, 4, 5
1 1 2 3
CROSSREFS
KEYWORD
nonn
AUTHOR
Neal Gersh Tolunsky, Mar 09 2023
EXTENSIONS
More terms from Samuel Harkness, Mar 10 2023
STATUS
approved