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 A103167 #14 Jan 30 2022 15:14:48
%S A103167 0,0,0,16,9,18,128,256,82,1024,2048,4096,2356,16384,32768,1980,131072,
%T A103167 262144,524288,1048576,2097152,159390,319770,16777216,10108899,
%U A103167 20228688,134217728,268435456,98713642,1073741824,2147483648,4294967296,2681134876,17179869184
%N A103167 a(n) = 2^n mod reverse(2^n).
%C A103167 Remainder if 2^n is divided by the reverse of 2^n.
%H A103167 Harvey P. Dale, <a href="/A103167/b103167.txt">Table of n, a(n) for n = 1..1000</a>
%e A103167 a(5) = 2^5 mod reverse(2^5) = 32 mod reverse(32) = 32 mod 23 = 9.
%t A103167 Table[Mod[FromDigits[Reverse[IntegerDigits[2^n]]], 2^n], {n, 1, 256}]
%t A103167 Table[PowerMod[2,n,IntegerReverse[2^n]],{n,40}] (* _Harvey P. Dale_, Jan 30 2022 *)
%o A103167 (Python)
%o A103167 def a(n): t = 2**n; return t%int(str(t)[::-1])
%o A103167 print([a(n) for n in range(1, 35)]) # _Michael S. Branicky_, Dec 12 2021
%Y A103167 Cf. A002113, A071590, A103164-A103167.
%K A103167 base,nonn
%O A103167 1,4
%A A103167 _Labos Elemer_, Jan 28 2005