|
Search: id:A104004
|
|
|
| A104004 |
|
G.f. (1-x)(1+x)/((2x-1)(x^2+x-1)). |
|
+0
3
|
|
| 1, 3, 7, 16, 35, 75, 158, 329, 679, 1392, 2839, 5767, 11678, 23589, 47555, 95720, 192427, 386451, 775486, 1555153, 3117071, 6245088, 12507887, 25044431, 50135230, 100345485
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A floretion-generated sequence relating to Fibonacci numbers and powers of 2. The sequence results from a particular transform of the sequence A000079*(-1)^n (powers of 2).
|
|
LINKS
|
Index entries for sequences related to linear recurrences with constant coefficients
|
|
FORMULA
|
4*a(n) = A008466(n+3) + A027973(n) (FAMP result); Superseeker results: a(n+2) - a(n+1) - a(n) = A042950(n+1); Coefficients of g.f.*(1-x)/(1+x) matches A099036; Coefficients of g.f./(1+x) matches A027934; Coefficients of g.f./(1-x^2) matches A008466;
a(n) = A101220(3, 2, n+1) - A101220(3, 2, n). - Ross La Haye (rlahaye(AT)new.rr.com), Aug 05 2005
3*2^n - Fibonacci(n+3). - Ralf Stephan, May 20 2007
|
|
MAPLE
|
with (combinat):a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=fibonacci(n-1)+2*a[n-1] od: seq(a[n], n=1..26); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 17 2008
|
|
PROGRAM
|
Floretion Algebra Multiplication Program, FAMP Code: 1jesforseq[ ( 5'i + .5i' + .5'ii' + .5e)*( + .5j' + .5'kk' + .5'ki' + .5e ) ], 1vesforseq = A000079(n+1)*(-1)^(n+1), ForType: 1A. Identity used: jesfor = jesrightfor + jesleftfor
|
|
CROSSREFS
|
Cf. A000079, A008466, A042950, A099036, A027934.
Sequence in context: A026734 A026767 A133124 this_sequence A101509 A099325 A026778
Adjacent sequences: A104001 A104002 A104003 this_sequence A104005 A104006 A104007
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Feb 24 2005
|
|
|
Search completed in 0.002 seconds
|
