|
Search: id:A137397
|
|
|
| A137397 |
|
Number of distinct palindromic subwords in the binary representation of n. |
|
+0
1
|
|
| 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Equals A070941 from a(1) to a(202), and continues a(203)=8, a(204)=a(205)=9.
Omitting "distinct" in the definition, we get 1, 2, 4, 4, 7, 7, 7, 7, 11, 11, 11, 11, 11, 11, 11, 11, 16, 16,... which apparently is build by repeating entries of A000124 in blocks of length 2,4,8,16,32..
|
|
LINKS
|
A. Glen, J. Justin, S. Widmer, L. Q. Zamboni, Palindromic Richness, arXiv:0801.1656 [math.CO]
|
|
EXAMPLE
|
For n=10 the binary representation is A007088(10)=1010, which contains the a(10)=5 palindromic substrings {}, {0}, {1}, {101}, {010}. The empty subword is always included in the count.
|
|
CROSSREFS
|
Cf. A070941.
Adjacent sequences: A137394 A137395 A137396 this_sequence A137398 A137399 A137400
Sequence in context: A057142 A098388 A094235 this_sequence A062571 A102515 A066063
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 11 2008
|
|
|
Search completed in 0.002 seconds
|
