id:A102828 - OEIS Search Results

Search: id:A102828

Displaying 1-1 of 1 results found.

page 1

"True already", base 2, start 1: a(n) is the least integer such that the sequence up to a(n-1) written in base 2 contains floor(a(n)/2) copies of the digit a(n) % 2, with a(0) = 1.

+0
1

1, 3, 7, 13, 19, 25, 31, 41, 47, 57, 65, 69, 75, 83, 91, 101, 109, 119, 131, 137, 143, 153, 161, 167, 177, 185, 195, 203, 213, 223, 237, 249, 261, 267, 275, 283, 293, 301, 311, 323, 331, 341, 351, 365, 377, 389, 397, 407, 419, 429, 441, 453, 463, 477, 491 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`Inspired by discussion of "True so far" from Eric Angelini (A102357)`
	CROSSREFS	`Cf. A102823-A102830, A102357.` `Sequence in context: A051635 A136009 A056531 this_sequence A117679 A100458 A000960` `Adjacent sequences: A102825 A102826 A102827 this_sequence A102829 A102830 A102831`
	KEYWORD	`nonn,easy,base`
	AUTHOR	`hv(AT)crypt.org (Hugo van der Sanden), Feb 26 2005`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research