Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055273
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055273 a(n)=3a(n-1)-a(n-2); a(0)=1, a(1)=8. +0
1
1, 8, 23, 61, 160, 419, 1097, 2872, 7519, 19685, 51536, 134923, 353233, 924776, 2421095, 6338509, 16594432, 43444787, 113739929, 297775000, 779585071, 2040980213, 5343355568, 13989086491, 36623903905, 95882625224 (list; graph; listen)
OFFSET

0,2

REFERENCES

A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

EXAMPLE

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

CROSSREFS

Cf. A055267.

Adjacent sequences: A055270 A055271 A055272 this_sequence A055274 A055275 A055276

Sequence in context: A048467 A002765 A048770 this_sequence A059209 A099274 A036562

KEYWORD

easy,nonn

AUTHOR

Barry E. Williams, May 28 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research