This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A357111 #23 Sep 26 2022 02:05:34 %S A357111 1,1,3,1,5,3,7,1,9,1,11,3,13,7,15,1,17,9,19,1,1,11,23,3,25,13,27,7,29, %T A357111 3,31,1,3,17,35,9,37,19,39,1,41,1,43,11,45,23,47,3,49,5,51,13,53,27, %U A357111 55,7,57,29,59,3,61,31,3,1,65,3,67,17,23,7,71,9,73,37,75 %N A357111 For n >= 1, a(n) = n / A076775(n). %H A357111 Robert Israel, <a href="/A357111/b357111.txt">Table of n, a(n) for n = 1..10000</a> %F A357111 a(n) = 1 for n = A076775(A032533(k)). %F A357111 a(n) != n for n = A354837(k), a(n) = n for all other odd n. %F A357111 a(n) != A000265(n) for n = 10*k and for n = 2^r * A354837(k), r >= 0, k >= 1. %e A357111 a(12) = 12 / A076775(12) = 3. %p A357111 f:= proc(n) local L,i; %p A357111 L:= convert(n,base,2); %p A357111 n/igcd(n,add(10^(i-1)*L[i],i=1..nops(L))); %p A357111 end proc: %p A357111 map(f, [$1..100]); # _Robert Israel_, Sep 11 2022 %t A357111 a[n_] := n / GCD[n, FromDigits@IntegerDigits[n, 2]]; Array[a, 100] (* _Amiram Eldar_, Sep 11 2022 *) %o A357111 (Python) %o A357111 from math import gcd %o A357111 def A357111(n): return n//gcd(n,int(bin(n)[2:])) # _Chai Wah Wu_, Sep 12 2022 %Y A357111 Cf. A000265, A032533, A076775, A354837. %K A357111 nonn,base,look %O A357111 1,3 %A A357111 _Ctibor O. Zizka_, Sep 11 2022