Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052913
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052913 a(0) = 1; a(1) = 4; a(n+2) = 5*a(n-1) - 2*a(n). +0
2
1, 4, 18, 82, 374, 1706, 7782, 35498, 161926, 738634, 3369318, 15369322, 70107974, 319801226, 1458790182, 6654348458, 30354161926, 138462112714, 631602239718, 2881086973162, 13142230386374 (list; graph; listen)
OFFSET

0,2

COMMENT

Main diagonal of the array : m(1,j)=3^(j-1), m(i,1)=1; m(i,j)=m(i-1,j)+m(i,j-1): 1 3 9 27 81 ... / 1 4 13 40 ... / 1 5 18 58 ... / 1 6 24 82 ... - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 05 2002

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 894

FORMULA

G.f.: (1-x)/(1-5*x+2*x^2).

Sum(1/17*(3+_alpha)*_alpha^(-1-n), _alpha=RootOf(1-5*_Z+2*_Z^2))

a(n) = ((17+3*sqrt(17))/34)*((5+sqrt(17))/2)^n + ((17-3*sqrt(17))/34)*((5-sqrt(17))/2)^n. - N. J. A. Sloane (njas(AT)research.att.com), Jun 03, 2002

MAPLE

spec := [S, {S=Sequence(Union(Prod(Sequence(Z), Union(Z, Z)), Z, Z))}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);

CROSSREFS

Sequence in context: A106391 A063881 A100192 this_sequence A129160 A143646 A014348

Adjacent sequences: A052910 A052911 A052912 this_sequence A052914 A052915 A052916

KEYWORD

easy,nonn

AUTHOR

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research