Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106854
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106854 Expansion of 1/(1-x(1-5x)). +0
9
1, 1, -4, -9, 11, 56, 1, -279, -284, 1111, 2531, -3024, -15679, -559, 77836, 80631, -308549, -711704, 831041, 4389561, 234356, -21713449, -22885229, 85682016, 200108161, -228301919, -1228842724, -87333129, 6056880491, 6493546136, -23790856319, -56258586999, 62695694596, 343988629591 (list; graph; listen)
OFFSET

0,3

COMMENT

Row sums of Riordan array (1,x(1-5x)). In general, a(n)=sum{k=0..n,(-1)^(n-k)*binomial(k,n-k)*r^(n-k)} yields the row sums of the Riordan array (1,x(1-kx)).

FORMULA

a(n)=((1+sqrt(-19))^(n+1)-(1-sqrt(-19))^(n+1))/(2^(n+1)sqrt(-19)); a(n)=sum{k=0..n, (-1)^(n-k)*binomial(k, n-k)*5^(n-k)}. a(n)=5^(n/2)(cos(-n*acot(sqrt(19)/19))-sqrt(19)sin(-n*acot(sqrt(19)/19))/19).

a(n)=a(n-1)-5*a(n-2), a(0)=1, a(1)=1. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 21 2008]

a(n)=Sum_{k, 0<=k<=n}A109466(n,k)*5^(n-k). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 25 2008]

PROGRAM

sage: [lucas_number1(n, 1, 5) for n in xrange(1, 35)] - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 16 2008

CROSSREFS

Sequence in context: A141365 A002641 A085724 this_sequence A099458 A069219 A010413

Adjacent sequences: A106851 A106852 A106853 this_sequence A106855 A106856 A106857

KEYWORD

easy,sign

AUTHOR

Paul Barry (pbarry(AT)wit.ie), May 08 2005

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research