|
| |
|
|
A022441
|
|
a(n) = c(n) + c(n-1) where c (A055562) is the sequence of numbers not in a.
|
|
2
| |
|
|
1, 5, 7, 10, 14, 17, 20, 23, 25, 28, 31, 34, 37, 40, 43, 46, 49, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 92, 95, 97, 100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
LINKS
| R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
|
FORMULA
| a(n) + a(n-1) = 3n + 2 - ( floor(log_2 n) mod 2) for n >= 1 - Jeffrey Shallit, Jun 08, 2000.
For n>0, a(n) = b(n) with b(0)=0, b(2n) = -b(n)+9n+3, b(2n+1) = -b(n)+9n+6-[n==0]. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 24 2003
|
|
|
MATHEMATICA
| A022441 := n->3*n + 2 - (floor(evalf(ln(n)/ln(2))) mod 2);
|
|
|
CROSSREFS
| Cf. A055562.
Sequence in context: A025074 A065503 A152001 * A156243 A020942 A190035
Adjacent sequences: A022438 A022439 A022440 * A022442 A022443 A022444
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
EXTENSIONS
| More terms from Winston C. Yang (winston(AT)cs.wisc.edu), Aug 23 2000
|
| |
|
|
