|
Search: id:A099942
|
|
|
| A099942 |
|
Start with 1, then alternately double or add 2. |
|
+0
1
|
|
| 1, 2, 4, 8, 10, 20, 22, 44, 46, 92, 94, 188, 190, 380, 382, 764, 766, 1532, 1534, 3068, 3070, 6140, 6142, 12284, 12286, 24572, 24574, 49148, 49150, 98300, 98302, 196604, 196606, 393212, 393214, 786428, 786430, 1572860, 1572862, 3145724, 3145726
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(2n) = A033484(n).
a(n-1) + a(n) = A061776(n) for n > 0.
|
|
FORMULA
|
a(0)=1; for n > 0, a(n) = a(n-1)*(1 + n mod 2) + 2*((n+1) mod 2).
G.f.: (2*x^3 + x^2 + 2*x + 1)/(2*x^4 - 3*x^2 + 1)
3*2^ceiling(n/2) + (-1)^n - 3. - Ralf Stephan, Dec 04 2004
|
|
PROGRAM
|
(PARI) print1(a=1, ", "); for(n=1, 20, print1(a=2*a, ", ", a=a+2, ", "))
|
|
CROSSREFS
|
Cf. A033484, A061776, A075427, A083416.
Sequence in context: A066363 A122636 A095726 this_sequence A033092 A004655 A127101
Adjacent sequences: A099939 A099940 A099941 this_sequence A099943 A099944 A099945
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Nov 12 2004
|
|
EXTENSIONS
|
Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 13 2004
|
|
|
Search completed in 0.002 seconds
|
