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

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

Antti Karttunen, Table of n, a(n) for n = 0..8192

Formula

Other identities. For all n >= 1:

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

Crossrefs

Cf. A005187, A055938.

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

Sequence in context: A116361 A375571 A106796 * A082850 A290695 A277446

Adjacent sequences: A265740 A265741 A265742 * A265744 A265745 A265746

Keyword

nonn

Author

Antti Karttunen, Dec 17 2015

Status

approved