Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106852
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106852 Expansion of 1/(1-x(1-3x)). +0
4
1, 1, -2, -5, 1, 16, 13, -35, -74, 31, 253, 160, -599, -1079, 718, 3955, 1801, -10064, -15467, 14725, 61126, 16951, -166427, -217280, 282001, 933841, 87838, -2713685, -2977199, 5163856, 14095453, -1396115, -43682474, -39494129, 91553293, 210035680, -64624199, -694731239, -500858642 (list; graph; listen)
OFFSET

0,3

COMMENT

Row sums of Riordan array (1,x(1-3x)) 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)).

Row sums of Riordan array (1/(1+3x^2),x/(1+3x^2)). - Paul Barry (pbarry(AT)wit.ie), Sep 10 2005

FORMULA

G.f.: 1/(1-x+3x^2); a(n)=2*sqrt(33)*3^(n/2)*cos((n+1)*atan(sqrt(11)/11)-pi*n/2)/11; a(n)=3^(n/2)(cos(-n*acot(sqrt(11)/11))-sqrt(11)*sin(-n*acot(sqrt(11)/11))/11); a(n)=((1+sqrt(-11))^(n+1)-(1-sqrt(-11))^(n+1))/(2^(n+1)sqrt(-11)); a(n)=sum{k=0..n, (-1)^(n-k)*binomial(k, n-k)*3^(n-k)}.

a(n)=sum{k=0..n, C((n+k)/2, k)*(-3)^((n-k)/2)*(1+(-1)^(n-k))/2}; a(n)=sum{k=0..floor(n/2), C(n-k, k)(-3)^k}; - Paul Barry (pbarry(AT)wit.ie), Sep 10 2005

CROSSREFS

Sequence in context: A104546 A121632 A121579 this_sequence A120294 A047921 A102786

Adjacent sequences: A106849 A106850 A106851 this_sequence A106853 A106854 A106855

KEYWORD

easy,sign

AUTHOR

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

page 1

Search completed in 0.002 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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research