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.
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
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 1..10001
Comments