|
%I #20 Nov 14 2019 10:45:53
%S 2,4,8,2192,21920,291008,610688,2112256,2131456,2937856,25329664,
%T 230465536,694018048,2344321024,4688642048,2112421888,65012891648,
%U 650128916480,4494196736,63769149440,637691494400,23842827272192,276298064723968,420127895977984,4897795987210240
%N Smallest solution to gcd(x, Rev(x)) = 2^n.
%H Giovanni Resta, <a href="/A071686/b071686.txt">Table of n, a(n) for n = 1..32</a>
%F a(n) = A069554(2^n).
%t a[n_] := Block[{k = 2^n}, While[GCD[k, FromDigits@ Reverse@ IntegerDigits@ k] != 2^n, k += 2^n]; k]; Array[a, 17] (* _Giovanni Resta_, Nov 14 2019 *)
%Y Cf. A004086, A055483, A069554, A072005, A072021, A072050.
%K nonn,base
%O 1,1
%A _Labos Elemer_, Jun 03 2002
%E a(22)-a(25) from _Giovanni Resta_, Oct 29 2019
|
