The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276613 The infinite trunk of greedy cubes beanstalk: The only infinite sequence such that a(n-1) = a(n) - number of cubes that sum to a(n) with greedy algorithm (A055401). 9
 0, 7, 14, 21, 26, 33, 40, 47, 52, 59, 63, 70, 77, 84, 89, 96, 103, 110, 115, 124, 131, 138, 145, 150, 157, 164, 171, 176, 183, 187, 194, 201, 208, 215, 222, 229, 236, 241, 248, 255, 262, 267, 274, 278, 285, 292, 299, 304, 311, 318, 330, 339, 342, 349, 356, 363, 368, 375, 382, 389, 394, 401, 405, 412, 419, 426, 431, 438, 445 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Antti Karttunen, Table of n, a(n) for n = 0..10236 FORMULA a(n) = A276614(A276612(n)). PROG (Scheme) (define (A276613 n) (A276614 (A276612 n))) CROSSREFS Cf. A055401, A261225, A276612, A276614, A276615 (first differences). Cf. also A179016, A259934, A276573, A276583, A276623 for similar constructions. Sequence in context: A339950 A242888 A037367 * A004939 A115417 A003330 Adjacent sequences:  A276610 A276611 A276612 * A276614 A276615 A276616 KEYWORD nonn AUTHOR Antti Karttunen, Sep 07 2016 STATUS approved

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

Last modified April 18 03:59 EDT 2021. Contains 343072 sequences. (Running on oeis4.)