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.

A340059 Limiting sequence when we start with positive integers and at step n >= 1, a(n) >= 1, subtract from the term at position n + a(n) the value A000005(a(n)). If no value a(n) at position n, take a(n) = n - A000005(n).

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 5, 6, 6, 6, 9, 10, 11, 10, 11, 12, 15, 12, 17, 17, 17, 18, 21, 18, 22, 24, 23, 22, 27, 24, 29, 28, 29, 30, 31, 34, 35, 36, 35, 32, 39, 36, 41, 40, 39, 42, 43, 38, 46, 36, 47, 46, 51, 46, 51, 52, 53, 54, 57, 58, 59, 60, 57
Offset: 1

Views

Author

Ctibor O. Zizka, Dec 27 2020

Keywords

Comments

At the vast majority of positions the term is changed at most once. The first position where the term is changed two times is 5.
The first position where the term is changed three times is 50. For n >= 4, a(n) < (n-2).

Examples

			n = 1, a(1) = 1, at position 1 + 1 = 2, a(2) = 2 - A000005(1) = 1;
n = 2, a(2) = 1, at position 2 + 1 = 3, a(3) = 3 - A000005(1) = 2;
n = 3, a(3) = 2, at position 3 + 2 = 5, a(5) = 5 - A000005(2) = 3;
n = 4, a(4) = 1, at position 4 + 1 = 5, a(5) = 3 - A000005(1) = 2;
n = 5, a(5) = 2, at position 5 + 2 = 7, a(7) = 7 - A000005(2) = 5;
n = 6, a(6) = 2, at position 6 + 2 = 8, a(8) = 8 - A000005(2) = 6;
n = 7, a(7) = 5, at position 7 + 5 = 12, a(12) = 12 - A000005(5) = 10;
n = 8, a(8) = 6, at position 8 + 6 = 14, a(14) = 14 - A000005(6) = 10;
n = 9, a(9) = 6, at position 9 + 6 = 15, a(15) = 15 - A000005(6) = 11;
n = 10, a(10) = 6, at position 10 + 6 = 16, a(16) = 16 - A000005(6) = 12;
and so on.
		

Crossrefs