login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129757 a(n) = ceiling((2^n + 1 - 2*floor(2^(n/2)))/2). 0

%I #16 Aug 08 2020 01:45:19

%S 1,1,3,5,12,25,54,113,235,481,980,1985,4007,8065,16204,32513,65175,

%T 130561,261421,523265,1047129,2095105,4191409,8384513,16771425,

%U 33546241,67097280,134201345,268412287,536838145,1073695485,2147418113

%N a(n) = ceiling((2^n + 1 - 2*floor(2^(n/2)))/2).

%o (PARI) a(n) = ceil((2^n + 1 - 2*floor(2^(n/2)))/2); \\ _Michel Marcus_, Aug 07 2020

%K nonn,easy,less

%O 1,3

%A _Roger L. Bagula_, May 15 2007

%E Edited by _Michel Marcus_ and _Joerg Arndt_, Aug 07 2020

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)