|
Search: id:A049039
|
|
|
| A049039 |
|
Geometric Connell sequence: 1 odd, 2 even, 4 odd, 8 even, ... |
|
+0
4
|
|
| 1, 2, 4, 5, 7, 9, 11, 12, 14, 16, 18, 20, 22, 24, 26, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 121, 123, 125
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
FORMULA
|
a(n) = 2n-1-floor(log_2(n)). a(2^n-1) = 2^(n+1)-(n+2), the Eulerian numbers
a(0)=0, a(2n) = a(n) + 2n - 1, a(2n+1) = a(n) + 2n + 1. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 11 2003
|
|
MAPLE
|
Digits := 100: [seq(2*n-1-floor(evalf(log(n)/log(2))), n=1..100)];
|
|
CROSSREFS
|
Cf. A001614, A033292, A030196, A000295, A050487, A050488.
Adjacent sequences: A049036 A049037 A049038 this_sequence A049040 A049041 A049042
Sequence in context: A083026 A047379 A093848 this_sequence A005152 A060831 A073727
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
James A. Sellers (sellersj(AT)math.psu.edu)
|
|
|
Search completed in 0.002 seconds
|
