Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095940
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095940 a(n+2) = 5a(n+1) - 3a(n) (n >= 1); a(0) = 0, a(1) = 1, a(2) = 4. +0
3
0, 1, 4, 17, 73, 314, 1351, 5813, 25012, 107621, 463069, 1992482, 8573203, 36888569, 158723236, 682950473, 2938582657, 12644061866, 54404561359, 234090621197, 1007239421908, 4333925245949, 18647907964021, 80237764082258 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=(1/2)*[5/2-(1/2)*sqrt(13)]^n-(3/26)*[5/2-(1/2)*sqrt(13)]^n*sqrt(13)+(3/26)*sqrt(13)*[5/2+(1 /2)*sqrt(13)]^n+(1/2)*[5/2+(1/2)*sqrt(13)]^n+[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Oct 02 2008]

CROSSREFS

Cf. A018902; equals A095934 - A095939.

Sequence in context: A085732 A083330 A018902 this_sequence A125586 A086351 A049027

Adjacent sequences: A095937 A095938 A095939 this_sequence A095941 A095942 A095943

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jul 13 2004

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 16 2004

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research