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 A260184 #10 Aug 07 2015 16:24:24
%S A260184 9,10,21,40,55,80,85,100,130,154,164,178,191,203,235,242,255,257,273,
%T A260184 282,292,300,328,400,455,585,656,819,910,2709,6643,8200,14762,32152,
%U A260184 53235,74647,428585,532900,1181729,1405397,4210945,5259525,27711772,719848917,43253138565
%N A260184 Numbers n written in base 10 that are palindromic in exactly three bases b, 2 <= b <= 10 and not simultaneously bases 2, 4 and 8.
%H A260184 Rick Regan, <a href="http://www.exploringbinary.com/finding-numbers-that-are-palindromic-in-multiple-bases/"> Finding numbers that are palindromic in multiple bases</a>
%H A260184 <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>
%F A260184 The intersection of A006995, A014190, A014192, A029952, A029953, A029954, A029803, A029955 & A002113 which yields just three members, not simultaneously bases 2, 4 and 8.
%e A260184 273 is in the sequence because 100010001_2 = 101010_3 = 10101_4 = 2043_5 = 1133_6 = 540_7 = 421_8 = 333_9 = 273_10 and three of the bases, namely 2, 4 & 9, yield palindromes.
%t A260184 (* see A214425 and set all terms as lst, then *)
%t A260184 gQ[n_] := Count[ palQ[n,#] & /@ {2, 4, 8}, True];
%t A260184 Select[ lst, gQ[#] != 3 &]
%Y A260184 Cf. A214426, A214425.
%K A260184 nonn,base
%O A260184 1,1
%A A260184 _Giovanni Resta_ and _Robert G. Wilson v_, Jul 17 2015