|
%I #6 Sep 08 2016 17:53:01
%S 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 83,88,91,95,99,102,107,110,114,117,120,123,128,131,135,138,143,146,
%U 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 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 Antti Karttunen, <a href="/A276583/b276583.txt">Table of n, a(n) for n = 0..10095</a>
%F a(n) = A276584(A276582(n)).
%o (Scheme) (define (A276583 n) (A276584 (A276582 n)))
%Y Cf. A053610, A260740, A276582, A276584, A276585 (first differences).
%Y Cf. also A179016, A259934, A276573, A276613, A276623 for similar constructions.
%K nonn
%O 0,2
%A _Antti Karttunen_, Sep 07 2016
|
