cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A384660 a(1) = 1. Thereafter a(n) = a(a(n-1)) if a(n-1) is a novel term, or n - S(n) if a(n-1) is a repeat term. S(n) is the sum of distinct terms in multiset {a(1),a(2),..a(n-1)}.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 2, 2, 3, 4, 1, 2, 3, 4, 5, 2, 2, 3, 4, 5, 6, 3, 2, 3, 4, 5, 6, 7, 2, 2, 3, 4, 5, 6, 7, 8, 2, 2, 3, 4, 5, 6, 7, 8, 9, 3, 2, 3, 4, 5, 6, 7, 8, 9, 10, 4, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 2, 2, 3, 4, 5, 6, 7
Offset: 1

Views

Author

David James Sycamore, Jun 06 2025

Keywords

Comments

Because of condition pertaining to novel terms the sequence contains a proper subsequence identical to itself, and consequently infinitely many such copies.

Examples

			a(1) = 1 is a novel term so a(2) = a(a(1)) = 1, which is a repeat term so a(3) = 3 - 1 = 2, another novel term so a(4) = a(a(2)) = a(1) = 1.
		

Crossrefs

Cf. A002260.

Programs

Extensions

More terms from Alois P. Heinz, Jun 06 2025