Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083881
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083881 a(0)=1, a(1)=3, a(n)=6a(n-1)-6a(n-2), n>=2. +0
6
1, 3, 12, 54, 252, 1188, 5616, 26568, 125712, 594864, 2814912, 13320288, 63032256, 298271808, 1411437312, 6678993024, 31605334272, 149558047488, 707716279296, 3348949390848, 15847398669312, 74990695670784, 354859782008832 (list; graph; listen)
OFFSET

0,2

COMMENT

Binomial transform of A001075.

FORMULA

a(n)=((3-sqrt(3))^n+(3+sqrt(3))^n)/2; a(n)=sum{k=0..floor(n/2); C(n, 2k)3^(n-2k)3^k }; G.f.: (1-3x)/(1-6x+6x^2); E.g.f.: exp(3x)cosh(x*sqrt(3)).

a(n) = right and left terms in M^n * [1 1 1] where M = the 3X3 matrix [1 1 1 / 1 4 1 / 1 1 1]. M^n * [1 1 1] = [a(n) A030192(n) a(n)]. E.g. a(3) = 54 since M^3 * [1 1 1] = [54 144 54] = [a(3) A030192(3) a(3)]. - Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 18 2004

a(n) = Sum_{k, 0<=k<=n}3^k*A098158(n,k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 04 2006

CROSSREFS

Cf. A083882.

Cf. A030192.

Adjacent sequences: A083878 A083879 A083880 this_sequence A083882 A083883 A083884

Sequence in context: A120983 A124810 A123348 this_sequence A055835 A125188 A054666

KEYWORD

easy,nonn

AUTHOR

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

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research