|
Search: id:A166395
|
|
|
| A166395 |
|
a(n) = the number of distinct nonzero decimal values k of substrings in the binary representation of n where k+1 is also the value of at least one substring in the binary representation of n. |
|
+0
2
|
|
| 0, 2, 0, 2, 2, 3, 0, 2, 2, 2, 3, 4, 4, 4, 0, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A166395(n) = A166396(n) + 1 if n is not of the form 2^m -1. A166395(2^m -1) = A166396(2^m -1) = 0, for all m.
|
|
EXAMPLE
|
13 in binary is 1101. 0 and 1 both occur as substrings in 1101. 1 and 10 (2 in decimal) both occur as substrings. 10 and 11 (3 in decimal) both occur as substrings. And 101 (5 in decimal) and 110 (6 in decimal) both occur as substrings. Since there are four values k where both binary k and binary k+1 also occurs as a substring in 1101, then a(13) = 4.
|
|
CROSSREFS
|
Cf. A166396
Sequence in context: A063088 A101276 A103863 this_sequence A061199 A144741 A103615
Adjacent sequences: A166392 A166393 A166394 this_sequence A166396 A166397 A166398
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Oct 13 2009
|
|
|
Search completed in 0.002 seconds
|
