Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020707
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020707 Pisot sequences E(4,8), L(4,8), P(4,8), T(4,8). +0
1
4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648, 4294967296, 8589934592 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = 2^(n+2). a(n) = 2a(n-1).

CROSSREFS

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

Adjacent sequences: A020704 A020705 A020706 this_sequence A020708 A020709 A020710

Sequence in context: A005934 A085629 A046055 this_sequence A049934 A089890 A049932

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research