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.

A272613 a(0)=1; thereafter a(n) = a(n-A272611(n)) + a(n-A272612(n)).

Original entry on oeis.org

1, 2, 2, 3, 4, 4, 5, 5, 6, 8, 6, 8, 9, 9, 13, 10, 12, 14, 11, 17, 17, 14, 17, 22, 16, 23, 17, 24, 22, 23, 23, 23, 26, 31, 28, 28, 35, 37, 32, 32, 39, 33, 39, 46, 34, 49, 33, 45, 48, 45, 46, 60, 54, 58, 56, 58, 50, 70, 54, 53, 73, 57, 61, 61, 77, 50, 73, 56, 68, 72
Offset: 0

Views

Author

Nathan Fox, May 03 2016

Keywords

Comments

This sequence exists as long as A272611 and A272612 exist.
Empirically, this sequence appears to grow approximately like n^a for some a between 1 and 2.

Crossrefs

Programs