login
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

%I #6 Sep 08 2016 17:53:42

%S 0,7,14,21,26,33,40,47,52,59,63,70,77,84,89,96,103,110,115,124,131,

%T 138,145,150,157,164,171,176,183,187,194,201,208,215,222,229,236,241,

%U 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 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 Antti Karttunen, <a href="/A276613/b276613.txt">Table of n, a(n) for n = 0..10236</a>

%F a(n) = A276614(A276612(n)).

%o (Scheme) (define (A276613 n) (A276614 (A276612 n)))

%Y Cf. A055401, A261225, A276612, A276614, A276615 (first differences).

%Y Cf. also A179016, A259934, A276573, A276583, A276623 for similar constructions.

%K nonn

%O 0,2

%A _Antti Karttunen_, Sep 07 2016