|
Search: id:A071689
|
|
|
| A071689 |
|
Number of ways to write n as n = x*y*z*t+x+y+z+t 0<=x<=y<=z<=t<=n. |
|
+0
1
|
|
| 1, 1, 2, 3, 4, 6, 7, 9, 10, 13, 15, 17, 19, 23, 24, 29, 31, 35, 37, 42, 45, 50, 53, 57, 62, 69, 71, 77, 81, 87, 92, 99, 102, 111, 116, 122, 128, 138, 140, 148, 156, 165, 170, 180, 184, 195, 203, 210, 218, 229, 236
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
PROGRAM
|
(PARI) for(n=0, 50, print1(sum(a=0, n, sum(b=0, a, sum(c=0, b, sum(d=0, c, if(a*b*c*d+a+b+c+d-n, 0, 1))))), ", "))
|
|
CROSSREFS
|
Sequence in context: A127963 A031403 A088572 this_sequence A076679 A060233 A026468
Adjacent sequences: A071686 A071687 A071688 this_sequence A071690 A071691 A071692
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 23 2002
|
|
|
Search completed in 0.002 seconds
|
