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 A072033 #19 Oct 28 2019 05:08:15
%S A072033 4,1,2,3,26,131,227,301,567,879,3240,11051,8048,38911,7321,97309,
%T A072033 108190,6294,138124,4675268,2687104,1336154,5774420
%N A072033 Smallest x > 0 such that gcd(2^x, A004086(2^x)) = 2^n.
%C A072033 a(14)=7321, a(17)=6294.
%F A072033 a(n) = min{x: gcd(2^x, reverse(2^x))=2^n} = min{x: A055483(x)=2^n}.
%F A072033 A072032(a(n)) = 2^n.
%e A072033 n=4: a(4)=26 because gcd(2^26, reverse(2^26)) = gcd(67108864, 46880176) = 16 = 2^n.
%t A072033 a[n_] := Block[{k=1}, While[ IntegerExponent[ GCD[2^k, FromDigits@ Reverse@ IntegerDigits[2^k]], 2] != n, k++]; k]; Array[a, 13, 0] (* _Giovanni Resta_, Oct 28 2019 *)
%Y A072033 Cf. A055483, A004086, A071686, A072032.
%K A072033 nonn,base,more
%O A072033 1,1
%A A072033 _Labos Elemer_, Jun 07 2002
%E A072033 Offset corrected, missing a(3) and a(13)-a(22) added by _Giovanni Resta_, Oct 28 2019