|
Search: id:A100545
|
|
|
| A100545 |
|
G.f.: (7-2x)/(x^2-3x+1). |
|
+0
2
|
|
| 7, 19, 50, 131, 343, 898, 2351, 6155, 16114, 42187, 110447, 289154, 757015, 1981891, 5188658, 13584083, 35563591, 93106690, 243756479, 638162747, 1670731762, 4374032539, 11451365855, 29980065026, 78488829223, 205486422643, 537970438706, 1408424893475, 3687304241719, 9653487831682, 25273159253327
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
A Floretion integer sequence relating to Fibonacci numbers.
Inverse binomial transform of A013655; inversion of A097924.
|
|
LINKS
|
Index entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n-1) = 4*F(2n) + F(2n-1) + F(2n+1), F = A000045; a(n) + a(n+1) = A055849(n+2)
a(n)=3*a(n-1)-a(n-2) with a(0)=7 and a(1)=19. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 16 2008]
|
|
MAPLE
|
F := proc(n) combinat[fibonacci](n) ; end: A100545 := proc(n) 4*F(2*(n+1))+F(2*n+1)+F(2*n+3) ; end: for n from 0 to 30 do printf("%d, ", A100545(n)) ; od ; (Mathar)
|
|
CROSSREFS
|
Cf. A001906, A005248, A097924, A013655.
Adjacent sequences: A100542 A100543 A100544 this_sequence A100546 A100547 A100548
Sequence in context: A003232 A018728 A027523 this_sequence A100450 A155423 A155347
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Dec 31 2004
|
|
EXTENSIONS
|
Corrected and extended by T. D. Noe (noe(AT)sspectra.com) and R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 26 2006
|
|
|
Search completed in 0.002 seconds
|
