Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056123
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056123 a(n)=3a(n-1)-a(n-2); a(0)=1, a(1)=11. +0
1
1, 11, 32, 85, 223, 584, 1529, 4003, 10480, 27437, 71831, 188056, 492337, 1288955, 3374528, 8834629, 23129359, 60553448, 158530985, 415039507, 1086587536, 2844723101, 7447581767, 19498022200, 51046484833, 133641432299 (list; graph; listen)
OFFSET

0,2

LINKS

Index entries for sequences related to linear recurrences with constant coefficients

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)={11*[((3+sqrt(5))/2)^n - ((3-sqrt(5))/2)^n]-[((3+sqrt(5))/2)^(n-1) - ((3-sqrt(5))/2)^(n-1)]}/sqrt(5).

G.f.(x)=(1+8x)/(1-3x+x^2).

6*Lucas(2n+1) - Fibonacci(2n+5).

CROSSREFS

Cf. A055850.

Sequence in context: A059134 A007790 A048773 this_sequence A006655 A018956 A018947

Adjacent sequences: A056120 A056121 A056122 this_sequence A056124 A056125 A056126

KEYWORD

easy,nonn

AUTHOR

Barry E. Williams, Jul 06 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 14:46 EST 2009. Contains 167570 sequences.


AT&T Labs Research