OFFSET
0,4
COMMENTS
A binary index of n is any position of a 1 in its reversed binary expansion. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. Every finite set of finite nonempty sets of positive integers has a different BII-number. For example, 18 has reversed binary expansion (0,1,0,0,1), and since the binary indices of 2 and 5 are {2} and {1,3} respectively, it follows that the BII-number of {{2},{1,3}} is 18. The weight of a set-system is the sum of sizes of its elements (sometimes called its edges).
LINKS
John Tyler Rascoe, Table of n, a(n) for n = 0..8192
FORMULA
a(2^x + ... + 2^z) = w(x + 1) + ... + w(z + 1), where x...z are distinct nonnegative integers and w = A000120. For example, a(6) = a(2^2 + 2^1) = w(3) + w(2) = 3.
EXAMPLE
The sequence of set-systems together with their BII-numbers begins:
0: {}
1: {{1}}
2: {{2}}
3: {{1},{2}}
4: {{1,2}}
5: {{1},{1,2}}
6: {{2},{1,2}}
7: {{1},{2},{1,2}}
8: {{3}}
9: {{1},{3}}
10: {{2},{3}}
11: {{1},{2},{3}}
12: {{1,2},{3}}
13: {{1},{1,2},{3}}
14: {{2},{1,2},{3}}
15: {{1},{2},{1,2},{3}}
16: {{1,3}}
17: {{1},{1,3}}
18: {{2},{1,3}}
19: {{1},{2},{1,3}}
20: {{1,2},{1,3}}
MATHEMATICA
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n, 2]], 1];
Table[Length[Join@@bpe/@bpe[n]], {n, 0, 100}]
PROG
(Python)
def bin_i(n): #binary indices
return([(i+1) for i, x in enumerate(bin(n)[2:][::-1]) if x =='1'])
def A326031(n): return sum(i.bit_count() for i in bin_i(n)) # John Tyler Rascoe, Jun 08 2024
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Gus Wiseman, Jul 20 2019
STATUS
approved