A366548 a(0) = 0; for n > 0, a(n) is the number of terms prior to the term a(n-1-a(n-1)) that equal a(n-1-a(n-1)).

0, 0, 1, 1, 0, 2, 1, 0, 3, 0, 4, 2, 4, 0, 5, 4, 1, 2, 2, 3, 3, 2, 1, 4, 1, 3, 4, 4, 3, 3, 4, 4, 5, 5, 4, 6, 5, 7, 6, 1, 1, 6, 0, 6, 0, 7, 1, 1, 8, 7, 6, 7, 7, 1, 4, 4, 3, 10, 9, 2, 0, 8, 10, 4, 5, 5, 8, 0, 9, 5, 4, 2, 6, 2, 6, 1, 6, 12, 5, 7, 5, 11, 12, 12, 6, 7, 7, 5, 1, 9, 8, 1, 3, 2, 13, 0

Offset

0,6

Comments

In the first 10 million terms the value 4 appears the most often, 11838 times, although the count of neighboring values is less than 2% different. It is unknown if this stays the most common term as n increases. In the same range on thirty-eight occasions there are three consecutive equal terms, the first time being a(105) = a(106) = a(107) = 8. It is unknown if four or more consecutive terms eventually appear.

Links

Scott R. Shannon, Table of n, a(n) for n = 0..10000

Scott R. Shannon, Image of the first 10 million terms.

Example

a(2) = 1 as a(2-1-a(2-1)) = a(1-0) = a(1) = 0, and there is one term prior to a(1) that equals 0, namely a(0).
a(6) = 1 as a(6-1-a(6-1)) = a(5-2) = a(3) = 1, and there is one term prior to a(3) that equals 1, namely a(2).

Crossrefs

Cf. A366549, A363193, A354971, A181391, A342585.

Sequence in context: A098493 A058560 A131047 * A143714 A004172 A082754

Adjacent sequences: A366545 A366546 A366547 * A366549 A366550 A366551

Keyword

nonn,look

Author

Scott R. Shannon, Oct 13 2023

Status

approved