login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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: A174430 A116361 A106796 * A082850 A290695 A277446

Adjacent sequences:  A265740 A265741 A265742 * A265744 A265745 A265746

KEYWORD

nonn

AUTHOR

Antti Karttunen, Dec 17 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 19 12:32 EDT 2019. Contains 325159 sequences. (Running on oeis4.)