login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
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.
LINKS
FORMULA
For n <= 3 a(n) = 1, else a(n) = a(a(A255131(n))) + a(n-a(A255131(n))).
PROG
(Scheme, with memoization-macro definec)
(definec (A284000 n) (if (<= n 3) 1 (+ (A284000 (A284000 (- n (A002828 n)))) (A284000 (- n (A284000 (- n (A002828 n))))))))
CROSSREFS
Sequence in context: A325631 A276073 A341311 * A309293 A244904 A338885
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 23 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)