|
Search: id:A104934
|
|
|
| A104934 |
|
G.f.: (x-1)/(2x^2+3x-1). |
|
+0
3
|
|
| 1, 2, 8, 28, 100, 356, 1268, 4516, 16084, 57284, 204020, 726628, 2587924, 9217028, 32826932, 116914852, 416398420, 1483024964, 5281871732, 18811665124, 66998738836, 238619546756, 849856117940, 3026807447332
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A floretion-generated sequence relating A007482, A007483, A007484. Inverse is A046717. Inverse of Fibonacci(3n+1). Binomial transform is A052984. Inverse binomial transform is A006131. Note: the conjectured relation 2*a(n) = A007482(n) + A007483(n-1) is a result of the FAMP identity dia[I] + dia[J] + dia[K] = jes + fam
|
|
FORMULA
|
Define A007483(-1) = 1. Then 2*a(n) = A007482(n) + A007483(n-1) (conjecture) a(n+2) = 4*A007484(n); ( Thus 8*A007484(n) = A007482(n+2) + A007483(n+1) ) a(n+1) = 2*A055099(n); a(n+2) - a(n+1) - a(n) = A007484(n+1) - A007484(n)
a(0)=1, a(1)=2, a(n)=3*a(n-1)+2*a(n-2) for n>1 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 19 2006
a(n)=Sum_{k, 0<=k<=n}2^k*A122542(n,k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 08 2006
|
|
PROGRAM
|
Floretion Algebra Multiplication Program, FAMP Code: 1dia[I]tesseq[A*B] with A = - .25'i + .25'j + .25'k - .25i' + .25j' + .25k' - .25'ii' + .25'jj' + .25'kk' + .25'ij' + .25'ik' + .25'ji' + .25'jk' + .25'ki' + .25'kj' - .25e and B = + 'i + i' + 'ji' + 'ki' + e
|
|
CROSSREFS
|
Cf. A007484, A007483, A007482, A104935, A055099, A046717, A052984, A006131.
Adjacent sequences: A104931 A104932 A104933 this_sequence A104935 A104936 A104937
Sequence in context: A060995 A106731 A066796 this_sequence A056711 A114590 A133592
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Mar 29 2005
|
|
|
Search completed in 0.002 seconds
|
