Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020705
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A020705
%S A020705 4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,
               29,30,
%T A020705 31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,
               54,55,
%U A020705 56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78
%N A020705 Pisot sequences E(4,5), P(4,5), T(4,5).
%H A020705 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A020705 a(n) = n+4. a(n) = 2a(n-1) - a(n-2).
%Y A020705 See A008776 for definitions of Pisot sequences.
%Y A020705 Sequence in context: A089166 A030543 A114143 this_sequence A081313 A081333 
               A026419
%Y A020705 Adjacent sequences: A020702 A020703 A020704 this_sequence A020706 A020707 
               A020708
%K A020705 nonn
%O A020705 0,1
%A A020705 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research