Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082605
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082605 Using Euler's 6-term sequence, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 + (-1)^(k-1)*2^(k-2), 3 <= k <= 5. Using this definition of a(k) we (formally) work backwards towards a(2)=5 to arrive at the formula for a(k) below. +0
6
2, 3, 5, 11, 17, 41, 65, 161, 257, 641, 1025, 2561, 4097, 10241, 16385, 40961, 65537, 163841, 262145, 655361, 1048577, 2621441, 4194305, 10485761, 16777217, 41943041, 67108865, 167772161, 268435457, 671088641, 1073741825, 2684354561 (list; graph; listen)
page 1

Search completed in 0.001 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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research