|
|
A276332
|
|
a(n) = number of terms of A001563 needed to sum to n when always choosing the largest term that divides the remaining n, a(0) = 0.
|
|
4
|
|
|
0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 1, 2, 5, 6, 7, 8, 6, 7, 8, 9, 7, 8, 9, 10, 8, 9, 10, 11, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 6, 7, 5, 6, 7, 8, 6, 7, 3, 4, 7, 8, 9, 10, 8, 9, 10, 11, 9, 10, 11, 12, 10, 11, 12, 13, 4, 5, 6, 7, 5, 6, 7, 8, 6, 7, 8, 9, 7, 8, 9, 10, 8, 9, 5, 6, 9, 10, 11, 12, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
Other identities and observations:
It seems that a(n) >= A276328(n) for all n.
|
|
EXAMPLE
|
For n=20, the largest term of A001563 that divides 20 is 4 and moreover, 4 is also the largest term of A001563 that divides 16, 12, 8 and 4, thus as 20 = 5*4, a(20) = 5.
For n=21, the largest term of A001563 that divides 21 is A001563(1) = 1, and case for 21 - 1 = 20 is shown above, thus a(21) = 1 + 5 = 6.
|
|
PROG
|
(Scheme, with memoization-macro definec)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|