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.

A284000 a(n) = a(a(n-A002828(n))) + a(n-a(n-A002828(n))) with a(1) = a(2) = a(3) = 1, where A002828(n) = the least number of squares that add up to n.

Original entry on oeis.org

1, 1, 1, 2, 3, 4, 5, 4, 5, 6, 7, 8, 9, 10, 9, 10, 9, 10, 11, 12, 13, 14, 15, 16, 15, 16, 17, 18, 17, 18, 19, 20, 19, 22, 21, 22, 23, 22, 23, 24, 25, 26, 27, 26, 27, 28, 29, 30, 29, 30, 31, 32, 33, 34, 35, 34, 37, 38, 37, 38, 39, 38, 39, 38, 39, 40, 39, 42, 41, 42
Offset: 1

Views

Author

Antti Karttunen, Mar 23 2017

Keywords

Comments

Does a(n)/n converge to some value near 0.6 ? See for example: a(10) = 6, a(100) = 62, a(1000) = 604, a(10000) = 6050, a(100000) = 60414.

Crossrefs

Formula

For n <= 3 a(n) = 1, else a(n) = a(a(A255131(n))) + a(n-a(A255131(n))).