Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020745
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020745 Pisot sequence T(3,5). +0
2
3, 5, 8, 12, 18, 27, 40, 59, 87, 128, 188, 276, 405, 594, 871, 1277, 1872, 2744, 4022, 5895, 8640, 12663, 18559, 27200, 39864, 58424, 85625, 125490, 183915, 269541, 395032, 578948, 848490, 1243523, 1822472, 2670963, 3914487, 5736960, 8407924, 12322412, 18059373 (list; graph; listen)
OFFSET

0,1

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 877

FORMULA

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

CROSSREFS

See A008776 for definitions of Pisot sequences.

Sequence in context: A098202 A164653 A001973 this_sequence A004398 A055606 A147879

Adjacent sequences: A020742 A020743 A020744 this_sequence A020746 A020747 A020748

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