login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010737 a(n) = 2*a(n-2) + 1. 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; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..34.

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, May 04 2003

MAPLE

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

PROG

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

CROSSREFS

Sequence in context: A187910 A283623 A020747 * A048625 A120134 A241451

Adjacent sequences:  A010734 A010735 A010736 * A010738 A010739 A010740

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Ulrich Hund (hund(AT)math.tu-berlin.de)

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 03:37 EDT 2019. Contains 328040 sequences. (Running on oeis4.)