OFFSET
0,5
COMMENTS
Complementary binary vectors are as per A378761.
a(n) gives the total number of distinct unordered tuples of complementary binary vectors of length n (including those with leading zeros) that have a common divisor > 1 as integers in base 10. Since any such tuple sums up to the repunit A002275(n), it corresponds to an integer partition of the repunit.
For n <= 5, a(n) coincides with A378511(n).
Starting from n=2, a(n) gives the row sums of T(n,k) in A378761.
a(n) = 1 for all n in A004023 (indices of prime repunits).
a(n) = 1 iff n is a term in A385537.
EXAMPLE
The only partition that counts toward A378761(4,1) is the trivial partition {1111} with only one part.
Among the possible pairs of nonzero binary vectors of length 4, exactly 3 are not coprime and therefore count toward A378761(4,2):
{1000,0111}: GCD(1000, 111) = 1;
{1001,0110}: GCD(1001, 110) = 11;
{1010,0101}: GCD(1010, 101) = 101;
{1011,0100}: GCD(1011, 100) = 1;
{1100,0011}: GCD(1100, 11) = 11;
{1101,0010}: GCD(1101, 10) = 1;
{1110,0001}: GCD(1110, 1) = 1.
PROG
(Python)
from math import gcd
from sympy.utilities.iterables import multiset_partitions
def A385539(n):
return sum(1 for p in multiset_partitions([10**k for k in range(n)]) if gcd(*(sum(t) for t in p))!=1) # Pontus von Brömssen, Jul 16 2025
CROSSREFS
KEYWORD
nonn,base,more
AUTHOR
Dmytro Inosov, Jul 02 2025
STATUS
approved
