Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020704
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020704 Pisot sequences E(3,10), P(3,10). +0
1
3, 10, 33, 109, 360, 1189, 3927, 12970, 42837, 141481, 467280, 1543321, 5097243, 16835050, 55602393, 183642229, 606529080, 2003229469, 6616217487, 21851881930, 72171863277, 238367471761, 787274278560, 2600190307441, 8587845200883, 28363725910090 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = 3a(n-1) + a(n-2) (holds at least up to n = 1000).

CROSSREFS

Subsequence of A006190. See A008776 for definitions of Pisot sequences.

Sequence in context: A060557 A018920 A006190 this_sequence A113299 A126931 A071722

Adjacent sequences: A020701 A020702 A020703 this_sequence A020705 A020706 A020707

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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