OFFSET
0,13
COMMENTS
We only consider maximal runs of one or more consecutive 1's (as counted by A069010) that completely match in binary expansions of n and k, not simply single common 1's.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 0..10010
Rémy Sigrist, Colored representation of the table for n, k < 2^10 (where the hue is function of T(n, k); black pixels denote 0's)
FORMULA
EXAMPLE
Table A(n, k) begins:
n\k| 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
---+------------------------------------------------------
0| 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1| 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0
2| 0 0 2 0 0 0 0 0 0 0 2 0 0 0 0 0
3| 0 0 0 3 0 0 0 0 0 0 0 3 0 0 0 0
4| 0 0 0 0 4 4 0 0 0 0 0 0 0 0 0 0
5| 0 1 0 0 4 5 0 0 0 1 0 0 0 1 0 0
6| 0 0 0 0 0 0 6 0 0 0 0 0 0 0 0 0
7| 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0
8| 0 0 0 0 0 0 0 0 8 8 8 8 0 0 0 0
9| 0 1 0 0 0 1 0 0 8 9 8 8 0 1 0 0
10| 0 0 2 0 0 0 0 0 8 8 10 8 0 0 0 0
11| 0 0 0 3 0 0 0 0 8 8 8 11 0 0 0 0
12| 0 0 0 0 0 0 0 0 0 0 0 0 12 12 0 0
13| 0 1 0 0 0 1 0 0 0 1 0 0 12 13 0 0
14| 0 0 0 0 0 0 0 0 0 0 0 0 0 0 14 0
15| 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 15
PROG
CROSSREFS
KEYWORD
AUTHOR
Rémy Sigrist, Mar 30 2022
STATUS
approved