id:A038585 - OEIS Search Results

Search: id:A038585

Displaying 1-1 of 1 results found.

page 1

Write n in binary, delete 0's.

+0
3

1, 1, 11, 1, 11, 11, 111, 1, 11, 11, 111, 11, 111, 111, 1111, 1, 11, 11, 111, 11, 111, 111, 1111, 11, 111, 111, 1111, 111, 1111, 1111, 11111, 1, 11, 11, 111, 11, 111, 111, 1111, 11, 111, 111, 1111, 111, 1111, 1111, 11111, 11, 111, 111, 1111, 111, 1111, 1111 (list; graph; listen)

	OFFSET	`1,3`
	MATHEMATICA	`Array[ dtn[ Cases[ IntegerDigits[ #, 2 ], 1 ] ]&, 70 ]`
	CROSSREFS	`Cf. A038573.` `Sequence in context: A095193 A010201 A063431 this_sequence A083768 A040131 A013618` `Adjacent sequences: A038582 A038583 A038584 this_sequence A038586 A038587 A038588`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from Erich Friedman (erich.friedman(AT)stetson.edu).`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research