|
Search: id:A001636
|
|
|
| A001636 |
|
A Fielder sequence: a(n)=a(n-1)+a(n-2)-a(n-7), n>=8.
(Formerly M0763 N0290)
|
|
+0
1
|
|
| 0, 2, 3, 6, 10, 17, 21, 38, 57, 92, 143, 225, 351, 555, 868, 1366, 2142, 3365, 5282, 8296, 13023, 20451, 32108, 50417, 79160, 124295, 195159, 306431, 481139, 755462, 1186184, 1862486, 2924375, 4591702, 7209646, 11320209, 17774393, 27908418
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
Fielder, Daniel C.; Special integer sequences controlled by three parameters. Fibonacci Quart 6 1968 64-70.
|
|
LINKS
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
|
|
FORMULA
|
G.f.: x^2*(2+x+x^2+x^3+x^4-6*x^5)/(1-x-x^2+x^7).
a(n)=a(n-2)+a(n-3)+a(n-4)+a(n-5)+a(n-6), n>=7.
|
|
MAPLE
|
A001636:=-z*(2+3*z+4*z**2+5*z**3+6*z**4)/(z+1)/(z**5+z**3+z-1); [Conjectured by S. Plouffe in his 1992 dissertation.]
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, polcoeff(x^2*(2+x+x^2+x^3+x^4-6*x^5)/(1-x-x^2+x^7)+x*O(x^n), n))
|
|
CROSSREFS
|
Cf. A013983.
Sequence in context: A066895 A105075 A140669 this_sequence A036588 A099517 A026647
Adjacent sequences: A001633 A001634 A001635 this_sequence A001637 A001638 A001639
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Edited by Michael Somos, Feb 17, 2002
|
|
|
Search completed in 0.002 seconds
|
