|
| |
|
|
A061889
|
|
a(n) = number of solutions to x_1 + x_2 + ... + x_n = x_{n+1} where each x_i is a factorial.
|
|
0
| |
|
|
1, 1, 2, 2, 3, 2, 4, 3, 5, 5, 7, 8, 10, 8, 13, 14, 15, 18, 20, 23, 29, 31, 36, 41, 49, 54, 63, 72, 80, 92, 108, 116, 137, 153, 174, 197, 222, 250, 281, 318, 354, 398, 450, 497, 561, 624, 697, 779, 869, 964, 1075, 1193, 1325, 1471, 1635, 1809, 2004, 2217, 2455, 2711
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,3
|
|
|
EXAMPLE
| a[6]=3 since 5!+5!+5!+5!+5!+5!=6!, 3!+3!+3!+2!+2!+2!=4! and 1!+1!+1!+1!+1!+1!=3!
|
|
|
MATHEMATICA
| f[n_, k_, m_] := (* # of partitions of n into k factorials <= m! *) Which[n==k, 1, m<=1||n<k|| n>k m!, 0, True, f[n, k, m]=f[n, k, m-1]+f[n-m!, k-1, m]]; a[n_] := Sum[f[r!, n, r-1], {r, 2, n}];
|
|
|
CROSSREFS
| Sequence in context: A205378 A103391 A178804 * A175012 A051693 A115980
Adjacent sequences: A061886 A061887 A061888 * A061890 A061891 A061892
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Erich Friedman (efriedma(AT)stetson.edu), Jun 23 2001
|
|
|
EXTENSIONS
| More terms from Dean Hickerson, Jun 25, 2001
|
| |
|
|
