|
| |
|
|
A071692
|
|
Number of ways to write n as n = x!+y!+z! 0<=x<=y<=z<=n.
|
|
0
| |
|
|
0, 0, 4, 3, 2, 1, 0, 3, 2, 1, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 3, 2, 1, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| If a(n) > 1 a(n+1) = a(n) - 1
|
|
|
PROG
| (PARI) for(n=1, 80, print1(sum(a=0, n, sum(b=0, a, sum(c=0, b, if(a!+b!+c!-n, 0, 1)))), ", "))
|
|
|
CROSSREFS
| Sequence in context: A022960 A023446 A066440 * A030586 A070635 A110366
Adjacent sequences: A071689 A071690 A071691 * A071693 A071694 A071695
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 23 2002
|
| |
|
|
