login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = number of terms of A005187 needed to sum to n using the greedy algorithm.
4

%I #9 Dec 18 2015 11:26:26

%S 0,1,2,1,1,2,3,1,1,2,1,1,2,3,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,2,1,1,2,

%T 1,1,2,3,1,1,2,1,1,2,3,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,2,3,1,1,2,1,1,

%U 2,3,1,1,2,1,1,2,3,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,1,1,2,1,1,2,3,1,1,2,1,1,2,3,2,2,3,4,1,1

%N a(n) = number of terms of A005187 needed to sum to n using the greedy algorithm.

%C a(0) = 0, because no numbers are needed to form an empty sum, which is zero.

%H Antti Karttunen, <a href="/A265743/b265743.txt">Table of n, a(n) for n = 0..8192</a>

%F Other identities. For all n >= 1:

%F a(A005187(n)) = 1 and a(A055938(n)) > 1.

%Y Cf. A005187, A055938.

%Y Cf. also A000120, A007895, A053610, A265404, A265744, A265745.

%K nonn

%O 0,3

%A _Antti Karttunen_, Dec 17 2015