|
Search: id:A001638
|
|
|
| A001638 |
|
A Fielder sequence: a(n)=a(n-1)+a(n-3)+a(n-4), n>=4.
(Formerly M3351 N1348)
|
|
+0
8
|
|
| 4, 1, 1, 4, 9, 11, 16, 29, 49, 76, 121, 199, 324, 521, 841, 1364, 2209, 3571, 5776, 9349, 15129, 24476, 39601, 64079, 103684, 167761, 271441, 439204, 710649, 1149851, 1860496, 3010349, 4870849, 7881196, 12752041, 20633239, 33385284, 54018521
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
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.: (1-x)(4+x+x^2)/((1+x^2)(1-x-x^2)). a(n)=L(n)+i^n+(-i)^n, a(2n)=L(n)^2, a(2n+1)=L(2n+1) where L() is Lucas sequence.
|
|
MAPLE
|
A001638:=-(z+1)*(4*z**2-z+1)/(z**2+z-1)/(z**2+1); [Conjectured by S. Plouffe in his 1992 dissertation.]
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, fibonacci(n+1)+fibonacci(n-1)+simplify(I^n+(-I)^n))
(PARI) a(n)=if(n<0, 0, polsym((1+x-x^2)*(1+x^2), n)[n+1])
|
|
CROSSREFS
|
Sequence in context: A026998 A080061 A124258 this_sequence A133826 A122185 A136680
Adjacent sequences: A001635 A001636 A001637 this_sequence A001639 A001640 A001641
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Edited by Michael Somos, Feb 17 2002 and Nov 2 2002
|
|
|
Search completed in 0.002 seconds
|
