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.
%I A276613 #6 Sep 08 2016 17:53:42 %S A276613 0,7,14,21,26,33,40,47,52,59,63,70,77,84,89,96,103,110,115,124,131, %T A276613 138,145,150,157,164,171,176,183,187,194,201,208,215,222,229,236,241, %U A276613 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 %N 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). %H A276613 Antti Karttunen, <a href="/A276613/b276613.txt">Table of n, a(n) for n = 0..10236</a> %F A276613 a(n) = A276614(A276612(n)). %o A276613 (Scheme) (define (A276613 n) (A276614 (A276612 n))) %Y A276613 Cf. A055401, A261225, A276612, A276614, A276615 (first differences). %Y A276613 Cf. also A179016, A259934, A276573, A276583, A276623 for similar constructions. %K A276613 nonn %O A276613 0,2 %A A276613 _Antti Karttunen_, Sep 07 2016