|
Search: id:A165417
|
|
|
| A165417 |
|
a(0) = a(1) = 1. For n >=2, a(n) = sum a(k), where k is over the distinct values of the substrings in binary n, and where 0 <= k < n. |
|
+0
2
|
|
| 1, 1, 2, 1, 4, 4, 5, 2, 8, 8, 8, 9, 14
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The distinct nonnegative values of the substrings of binary n is row n of table A119709.
a(2^n) = 2^n, for all n.
|
|
EXAMPLE
|
9 in binary is 1001. The distinct nonnegative integers that occur as substrings in binary 9 are 0, 1, 2 (10 in binary), 4 (100 in binary), and 9 (1001 in binary). So a(9) = a(0)+a(1)+a(2)+a(4) = 1 + 1 + 2 + 4 = 8.
|
|
CROSSREFS
|
A119709, A165418
Sequence in context: A136692 A101452 A019963 this_sequence A108755 A093049 A081243
Adjacent sequences: A165414 A165415 A165416 this_sequence A165418 A165419 A165420
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Sep 17 2009
|
|
|
Search completed in 0.005 seconds
|
