id:A141297 - OEIS Search Results

Search: id:A141297

Displaying 1-1 of 1 results found.

page 1

a(n) = number of distinct (nonempty) substrings in the binary representation of n.

+0
4

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

	OFFSET	`1,2`
	COMMENT	`Substrings may start with a 0.` `The terms were calculated by Richard Mathar.`
	EXAMPLE	`The distinct substrings in binary representation (1010) of decimal 10 are 0,1,10,01,101,010,1010. So a(10) = 7.`
	CROSSREFS	`Cf. A141298, A141299, A141300, A122953.` `Adjacent sequences: A141294 A141295 A141296 this_sequence A141298 A141299 A141300` `Sequence in context: A127703 A127738 A001598 this_sequence A059319 A019828 A115207`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Jun 24 2008`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research