Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A010737
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A010737 a(n) = 2*a(n-2) + 1. +0
2
4, 6, 9, 13, 19, 27, 39, 55, 79, 111, 159, 223, 319, 447, 639, 895, 1279, 1791, 2559, 3583, 5119, 7167, 10239, 14335, 20479, 28671, 40959, 57343, 81919, 114687, 163839, 229375, 327679, 458751, 655359 (list; graph; listen)
OFFSET

0,1

FORMULA

a(2n)=5*2^n-1 and a(2n+1)=7*2^n-1 or a(n)=(6-(-1)^n)*2^floor(n/2)-1 - Benoit Cloitre (benoit7848c(AT)orange.fr), May 04 2003

MAPLE

A010737 := proc(n) options remember; if n <= 1 then 2*n+4 else 2*A010737(n-2)+1; fi end;

PROGRAM

(PARI) a(n)=(6-(-1)^n)*2^floor(n/2)-1

CROSSREFS

Adjacent sequences: A010734 A010735 A010736 this_sequence A010738 A010739 A010740

Sequence in context: A085802 A084916 A020747 this_sequence A048625 A120134 A112381

KEYWORD

nonn,easy

AUTHOR

njas, Ulrich Hund (hund(AT)math.tu-berlin.de)

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 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research