|
Search: id:A071693
|
|
|
| A071693 |
|
Number of ways to write n as n = x*y*z+x+y+z 0<=x<=y<=z<=n. |
|
+0
1
|
|
| 1, 2, 2, 4, 3, 5, 4, 6, 6, 7, 6, 9, 7, 10, 9, 11, 9, 12, 11, 13, 12, 13, 12, 17, 14, 16, 15, 17, 16, 19, 16, 19, 19, 20, 19, 24, 19, 21, 22, 25, 21, 26, 22, 26, 25, 26, 25, 29, 27, 28, 28, 29, 27, 33, 29, 33, 30, 31, 32, 37, 32, 34, 34, 37, 34, 38, 34, 38, 38, 39, 36, 43, 38, 40
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
PROGRAM
|
(PARI) for(n=1, 80, print1(sum(a=0, n, sum(b=0, a, sum(c=0, b, if(a*b*c+a+b+c-n, 0, 1)))), ", "))
|
|
CROSSREFS
|
Sequence in context: A054346 A132802 A070803 this_sequence A007728 A077026 A060026
Adjacent sequences: A071690 A071691 A071692 this_sequence A071694 A071695 A071696
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 23 2002
|
|
|
Search completed in 0.002 seconds
|
