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.

Showing 1-1 of 1 results.

A283882 Relative of Hofstadter Q-sequence: a(n) = max(0, n+67) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) for n > 0.

Original entry on oeis.org

3, 68, 69, 5, 70, 6, 7, 71, 73, 10, 8, 73, 77, 12, 74, 14, 79, 11, 78, 82, 16, 13, 17, 15, 81, 20, 20, 142, 73, 24, 32, 138, 3, 32, 207, 5, 138, 3, 5, 345, 5, 138, 3, 5, 483, 5, 138, 3, 5, 621, 5, 138, 3, 5, 759, 5, 138, 3, 5, 897, 5, 138, 3, 5, 1035, 5, 138, 3, 5, 1173, 5, 138, 5, 8, 1311
Offset: 1

Views

Author

Nathan Fox, Mar 19 2017

Keywords

Comments

Sequences like this are more naturally considered with the first nonzero term in position 1. But this sequence would then match A000027 for its first 67 terms.

Crossrefs

Programs

Formula

If the index is between 35 and 72 (inclusive), then a(5n) = 138n-759, a(5n+1) = 5, a(5n+2) = 138, a(5n+3) = 3, a(5n+4) = 5.
If the index is between 78 and 1245 (inclusive), then a(5n) = 1311, a(5n+1) = 3, a(5n+2) = 5, a(5n+3) = 1311n-17181, a(5n+4) = 5.
If the index is between 1251 and 309192 (inclusive), then a(5n) = 5, a(5n+1) = 19047817435n-1178393232110703, a(5n+2) = 5, a(5n+3) = 19047817435, a(5n+4) = 3.
If the index is between 309336 and 19047817368 (inclusive), then a(5n) = 5, a(5n+1) = 309258n-76697295, a(5n+2) = 5, a(5n+3) = 309258, a(5n+4) = 3.
If the index is at least 19047817371, then a(5n) = 5*A272611(n-3809563474), a(5n+1) = 5*A272611(n-3809563473), a(5n+2) = 5*A272612(n-3809563473), a(5n+3) = 19047817435*A272613(n-3809563473), a(5n+4) = 4. This pattern lasts as long as A272611 exists (which is conjectured to be forever).
Showing 1-1 of 1 results.