id:A095160 - OEIS Search Results

Search: id:A095160

Displaying 1-1 of 1 results found.

page 1

Let B(n) be the sum of binary digits of n. Sequence contains n such that B(n) = B(digit sum(n)).

+0
1

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 18, 24, 25, 33, 36, 38, 48, 49, 52, 56, 66, 67, 70, 72, 74, 76, 78, 129, 132, 133, 136, 137, 144, 146, 148, 164, 176, 177, 192, 193, 194, 195, 264, 265, 266, 267, 274, 288, 289, 290, 292, 294, 304, 320, 322, 328, 388, 392, 393, 416, 456 (list; graph; listen)

	OFFSET	`0,3`
	CROSSREFS	`Cf. A007953, A000120.` `Adjacent sequences: A095157 A095158 A095159 this_sequence A095161 A095162 A095163` `Sequence in context: A114440 A097518 A097569 this_sequence A059043 A138141 A001102`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 20 2004`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research