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 A276583 #6 Sep 08 2016 17:53:01 %S A276583 0,3,6,8,11,15,18,21,24,27,32,35,38,43,48,51,56,59,63,66,71,74,78,80, %T A276583 83,88,91,95,99,102,107,110,114,117,120,123,128,131,135,138,143,146, %U A276583 151,154,158,161,164,168,171,176,179,183,186,192,195,198,203,206,210,213,219,224,227,232,235,239,242,248,251,255 %N A276583 The infinite trunk of greedy squares beanstalk: The only infinite sequence such that a(n-1) = a(n) - number of squares that sum to a(n) with greedy algorithm (A053610). %H A276583 Antti Karttunen, <a href="/A276583/b276583.txt">Table of n, a(n) for n = 0..10095</a> %F A276583 a(n) = A276584(A276582(n)). %o A276583 (Scheme) (define (A276583 n) (A276584 (A276582 n))) %Y A276583 Cf. A053610, A260740, A276582, A276584, A276585 (first differences). %Y A276583 Cf. also A179016, A259934, A276573, A276613, A276623 for similar constructions. %K A276583 nonn %O A276583 0,2 %A A276583 _Antti Karttunen_, Sep 07 2016