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 A136522 #37 Jun 23 2022 15:42:56
%S A136522 1,1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
%T A136522 0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,
%U A136522 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0
%N A136522 a(n) = 1 if n is a palindrome, otherwise 0.
%C A136522 a(A002113(n)) = 1; a(A029742(n)) = 0.
%C A136522 a(n) = A202022(n) for n <= 100, a(101) = 1, A202022(101) = 0. - _Reinhard Zumkeller_, Dec 10 2011
%H A136522 Reinhard Zumkeller, <a href="/A136522/b136522.txt">Table of n, a(n) for n = 0..10000</a>
%H A136522 <a href="/index/Ch#char_fns">Index entries for characteristic functions</a>
%H A136522 <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>
%F A136522 a(n) = if A004086(n) = n then 1 else 0. - _Reinhard Zumkeller_, Apr 08 2011
%F A136522 a(n) = A000007(A064834(n)). - _Reinhard Zumkeller_, Sep 18 2013
%t A136522 fQ[n_]:=Module[{id=IntegerDigits[n]}, Boole[id==Reverse[id]]]; Array[fQ, 100] (* _Vladimir Joseph Stephan Orlovsky_, Dec 29 2010 *)
%t A136522 Table[If[PalindromeQ[n],1,0],{n,0,120}] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Aug 23 2019 *)
%o A136522 (Haskell)
%o A136522 a136522 n = fromEnum $ n == a004086 n -- _Reinhard Zumkeller_, Apr 08 2011
%o A136522 (Python)
%o A136522 def A136522(n): return int((s:=str(n))[:(t:=(len(s)+1)//2)]==s[:-t-1:-1]) # _Chai Wah Wu_, Jun 23 2022
%Y A136522 Cf. A002113, A136687, A137180.
%Y A136522 Cf. A178225.
%K A136522 nonn,base
%O A136522 0,1
%A A136522 _N. J. A. Sloane_, Apr 21 2008