|
| |
|
|
A059010
|
|
Even number of 0's in binary expansion.
|
|
7
| |
|
|
1, 3, 4, 7, 9, 10, 12, 15, 16, 19, 21, 22, 25, 26, 28, 31, 33, 34, 36, 39, 40, 43, 45, 46, 48, 51, 53, 54, 57, 58, 60, 63, 64, 67, 69, 70, 73, 74, 76, 79, 81, 82, 84, 87, 88, 91, 93, 94, 97, 98, 100, 103, 104, 107, 109, 110, 112, 115, 117, 118, 121, 122, 124, 127, 129, 130
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
REFERENCES
| C. Kimberling, Affinely recursive sets and orderings of languages, Discrete Math., 274 (2004), 147-160. [From N. J. A. Sloane, Jan 31 2012]
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=0..1000
J.-P. Allouche, J. Shallit and G. Skordev, Self-generating sets, integers with missing blocks and substitutions, Discrete Math. 292 (2005) 1-15.
|
|
|
FORMULA
| a(0) = 1, a(2n) = -a(n) + 6n + 1, a(2n+1) = a(n) + 2n + 2. a(n) = 2n+1 - 1/2(1-(-1)^A023416(n)) = 2n+1-A059448(n). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 17 2003
|
|
|
MATHEMATICA
| Select[Range[130], EvenQ @ DigitCount[#, 2, 0] &] (* From Jean-François Alcover, Apr 11 2011 *)
|
|
|
CROSSREFS
| Cf. A000069, A001969, A059009-A059014.
Sequence in context: A088958 A026225 A026140 * A066928 A032726 A029739
Adjacent sequences: A059007 A059008 A059009 * A059011 A059012 A059013
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| Patrick De Geest (pdg(AT)worldofnumbers.com), Dec 15 2000.
|
| |
|
|
