login
A265743
a(n) = number of terms of A005187 needed to sum to n using the greedy algorithm.
4
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, 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, 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
OFFSET
0,3
COMMENTS
a(0) = 0, because no numbers are needed to form an empty sum, which is zero.
LINKS
FORMULA
Other identities. For all n >= 1:
a(A005187(n)) = 1 and a(A055938(n)) > 1.
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 17 2015
STATUS
approved