login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A379126
a(1) = 1; for n > 1, a(n) is the least number k such that A325567(k) = n, or 0 if no such number exists.
0
1, 4, 9, 8, 35, 18, 49, 16, 135, 70, 33, 36, 65, 98, 225, 32, 527, 270, 133, 140, 651, 66, 161, 72, 775, 130, 837, 196, 899, 450, 961, 64, 2079, 1054, 525, 540, 259, 266, 273, 280, 2583, 1302, 129, 132, 2835, 322, 705, 144, 3087, 1550, 3213, 260, 3339, 1674, 385, 392, 1539, 1798, 3717, 900, 3843, 1922, 3969, 128
OFFSET
1,2
COMMENTS
By definition, sequence is injective (apart from possible 0's) and each a(n) is a multiple of n.
FORMULA
a(n) = n * A379228(n).
PROG
(PARI)
A048720(b, c) = fromdigits(Vec(Pol(binary(b))*Pol(binary(c)))%2, 2);
A065621(n) = bitxor(n-1, n+n-1);
memoA325567 = Map();
A325567(n) = if(1==n, 1, my(v); if(mapisdefined(memoA325567, n, &v), v, fordiv(n, d, if((d>1)&&A048720(A065621(n/d), d)==n, v = (n/d); break)); mapput(memoA325567, n, v); (v)));
A379126(n) = for(k=1, oo, if(A325567(k)==n, return(k)));
CROSSREFS
Cf. A048720, A065621, A277320, A325567, A379128 (odd bisection), A379228 [= a(n)/n].
Cf. also A115872, A266195, A266351.
Sequence in context: A168175 A164382 A145521 * A230979 A145431 A196516
KEYWORD
nonn,new
AUTHOR
Antti Karttunen, Dec 21 2024
STATUS
approved