Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141298
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141298 a(n) = number of distinct substrings in the binary representation of n that each occur multiple times. +0
4
0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 1, 2, 1, 2, 3 (list; graph; listen)
OFFSET

1,7

COMMENT

Substrings may start with a 0.

EXAMPLE

The distinct substrings that occur multiple times in decimal 10 = binary 1010 are 0,1 and 10. So a(10)=3.

CROSSREFS

Cf. A141297, A141299, A141300.

Adjacent sequences: A141295 A141296 A141297 this_sequence A141299 A141300 A141301

Sequence in context: A071455 A139465 A010244 this_sequence A103960 A024936 A141059

KEYWORD

more,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Jun 24 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research