|
| |
|
|
A093505
|
|
a(n) = ceiling(A001969(n)/2 + 1/2).
|
|
1
| |
|
|
1, 2, 3, 3, 5, 5, 6, 8, 9, 9, 10, 12, 12, 14, 15, 15, 17, 17, 18, 20, 20, 22, 23, 23, 24, 26, 27, 27, 29, 29, 30, 32, 33, 33, 34, 36, 36, 38, 39, 39, 40, 42, 43, 43, 45, 45, 46, 48, 48, 50, 51, 51, 53, 53, 54, 56, 57, 57, 58, 60, 60, 62, 63, 63, 65
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| a(n) = A001969(n) - n + 1 for n >= 2. Sequence (without first term) is inverse (frequency distribution) sequence of A161560. For n >= 2 we have: a(A000069(n-1)+1) = n, otherwise a(n) = n - 1. A000069(n) = odious numbers, A001969(n) = evil numbers.
|
|
|
EXAMPLE
| a(5) = 5 because the fifth evil number = 9 and ceiling(9/2 + 1/2) = 5.
|
|
|
CROSSREFS
| Cf. A001969.
Sequence in context: A159237 A010761 A161172 * A146071 A167411 A112823
Adjacent sequences: A093502 A093503 A093504 * A093506 A093507 A093508
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Michael Joseph Halm (hierogamous(AT)lycos.com), May 13 2004
|
|
|
EXTENSIONS
| Corrected and edited by Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jun 13 2009
|
| |
|
|
