id:A141300 - OEIS Search Results

Search: id:A141300

Displaying 1-1 of 1 results found.

page 1

a(n) = number of distinct (nonempty) substrings in the binary representation of n that each occur exactly once.

+0
4

1, 3, 1, 4, 4, 4, 1, 5, 6, 4, 7, 6, 7, 5, 1, 6, 8, 8, 10, 8, 4, 8, 9, 8, 10, 8, 9, 8, 9, 6, 1, 7, 10, 11, 13, 9, 11, 13, 13, 11, 11, 4, 9, 13, 9, 11, 11, 10, 13, 13, 13, 13, 9, 9, 13, 11, 13, 11, 13, 10, 11, 7, 1, 8, 12, 14, 16, 14, 15, 17, 17, 14, 9, 14, 17, 15, 17, 17, 16, 14, 15, 14, 17 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Substrings may start with a 0.`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`In (decimal 10 =) binary 1010: 01, 101, 010, 1010 each occur exactly once. So a(10) = 4.`
	CROSSREFS	`Cf. A141297, A141298, A141299.` `Sequence in context: A129246 A125608 A099813 this_sequence A014388 A117374 A021322` `Adjacent sequences: A141297 A141298 A141299 this_sequence A141301 A141302 A141303`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Jun 24 2008`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 25 2009`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research