login
a(n) is the smallest k such that A292849(k) = 2n-1.
1

%I #30 Jan 10 2021 11:10:17

%S 1,3,13,5,57,35,21,9,241,219,49,45,169,83,73,17,993,59,941,53,3197,51,

%T 185,93,209,81,349,85,41,89,105,33,4033,491,4749,247,449,227,429,363,

%U 3249,401,193,259,233,107,117,189,697249,1355,173,517,473,1091,101,231,725,305

%N a(n) is the smallest k such that A292849(k) = 2n-1.

%C This implies that a(n)=k is a solution to A000120(2*n-1) = A000120((2*n-1)*k), where A000120 is the Hamming weight. If no such number exists we define a(n) = 2.

%C Does this sequence consist only of odd numbers? It appears so.

%C This will be the case if A292849 contains all odd numbers, because a(n) will then never become 2.

%C A292849 must contain all odd numbers if two conditions are satisfied:

%C First: For every odd number 2n-1 there must be an odd k > 1 that satisfies A000120(2n-1) = A000120((2n-1)*k). To prove that this condition is satisfied, it may be helpful that if k*m = 2^j+r, we know that A000120(k*m) = A063787(r) and for each Hamming weight there exists an r such that A063787(r) = A063787(r+1). This allows us to choose r such that the Hamming weight becomes A000120(m) = A063787(r). For a given r, k*m = 2^j+r may have no solutions if k or m are divisors of r, but there may still exist a solution for k*m = 2^j+r+1. Of course this is not a complete proof.

%C Second: For every n there needs to be a number k such that 2n-1 is the smallest solution to A000120(2n-1) = A000120((2n-1)*k). This is satisfied if no row in A340441 is a subset of a previous row.

%C No odd number can appear more than once in this sequence, but not all odd numbers will appear, so this sequence is not a permutation of the odd numbers.

%C This sequence can be constructed from A340441. Start with a(1) = 1, then a(n) is the least number in row n-1 of A340441 that has not already appeared in A340441.

%o (MATLAB)

%o function a = A340349(maxA292849)

%o c = A340351(maxA292849,1);

%o n = 1; run = 1;

%o while run == 1

%o i = find(c==(n*2)-1);

%o if ~isempty(i);

%o a(n) = i(1);

%o n = n+1;

%o else

%o run = 0;

%o end

%o end

%o end

%o function a = A340351(max_n,max_m)

%o for n = 1:max_n

%o m = 1; k = 1;

%o while m < max_m+1

%o c = length(find(bitget(k,1:32)== 1));

%o if c == length(find(bitget(n*k,1:32)== 1))

%o a(n,m) = k;

%o m = m+1;

%o end

%o k = k +1;

%o end

%o end

%o end

%o (PARI) f(n) = my(k=1); while ((hammingweight(k)) != hammingweight(k*n), k++); k; \\ A292849

%o a(n) = my(k=1); while(f(k) != 2*n-1, k++); k; \\ _Michel Marcus_, Jan 09 2021

%Y Cf. A000120, A292849, A340069, A263132, A077459, A295827, A340441, A340351 table of multiplications.

%K nonn,base

%O 1,2

%A _Thomas Scheuerle_, Jan 05 2021