|
Search: id:A104161
|
|
|
| A104161 |
|
G.f. x(-x^2+x-1)/((x-1)^2(x^2+x-1)). |
|
+0
10
|
|
| 0, 1, 2, 5, 10, 19, 34, 59, 100, 167, 276, 453, 740, 1205, 1958, 3177, 5150, 8343, 13510, 21871, 35400, 57291, 92712, 150025, 242760, 392809, 635594, 1028429, 1664050, 2692507, 4356586, 7049123
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
A floretion-generated sequence.
A107909(a(n)) = A000975(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 28 2005
|
|
LINKS
|
Index entries for sequences related to linear recurrences with constant coefficients
|
|
FORMULA
|
Superseeker results (incomplete): a(+2) - 2a(n+1) + a(n) = A006355(n+1) (Number of binary vectors of length n containing no singletons.); a(n+1) - a(n) = A001595(n) (2-ranks of difference sets constructed from Segre hyperovals); a(n) + n + 1 = A001595(n+1)
a(n) = 2(Fibonacci(n+2) - 1) - n. a(n) = Sum[A101220(n-k, 0, k), {k=0...n}]. - Ross La Haye (rlahaye(AT)new.rr.com), Aug 03 2005
a(n) = a(n-1) + a(n-2) + n-1; a(n) = row sums of A117915, starting (1, 2, 5, 10...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 02 2006
a(n) = Sum[A109754(n-k,k), {k,0,n}]. - Ross La Haye (rlahaye(AT)new.rr.com), Apr 12 2006
a(n) = Sum[(n-k)Fibonacci(k-1) + Fibonacci(k),{k,0,n}] - n. - Ross La Haye (rlahaye(AT)new.rr.com), May 31 2006
a(n) = -2-n+(-A094214)^n*(1-A010499/5)+(1+A010499/5)/A094214^n . a(n) = A006355(n+3)-n-2 . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 18 2008
|
|
PROGRAM
|
Floretion Algebra Multiplication Program, FAMP Code: 1vesrokseq[ (- .25'i - .25i' - .25'ii' + .25'jj' + .25'kk' + .25'jk' + .25'kj' - .25e)('i + i' + 'ji' + 'ki' + e) ] RokType: Y[sqa.Findk()] = Y[sqa.Findk()] + p.
|
|
CROSSREFS
|
Cf. A006355, A001595.
Sequence in context: A132210 A000098 A024827 this_sequence A065613 A061705 A052944
Adjacent sequences: A104158 A104159 A104160 this_sequence A104162 A104163 A104164
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Mar 10 2005
|
|
|
Search completed in 0.002 seconds
|
