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 A259389 #13 Aug 18 2015 12:57:29
%S A259389 0,1,2,3,4,5,7,80,154,191,209,910,3740,5740,8281,16562,16814,2295481,
%T A259389 2300665,2350165,2439445,2488945,2494129,2515513,7971580,48307924,
%U A259389 61281793,69432517,123427622,124091822,124443290,55854298990,184314116750,185794441250,187195815770,327925630018,7264479038060,27832011695551
%N A259389 Palindromic numbers in bases 6 and 9 written in base 10.
%H A259389 Giovanni Resta, <a href="/A259389/b259389.txt">Table of n, a(n) for n = 1..57</a>
%H A259389 <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>
%F A259389 Intersection of A029953 and A029955.
%e A259389 209 is in the sequence because 209_10 = 252_9 = 545_6.
%t A259389 (* first load nthPalindromeBase from A002113 *) palQ[n_Integer, base_Integer] := Block[{}, Reverse[ idn = IntegerDigits[n, base]] == idn]; k = 0; lst = {}; While[k < 21000000, pp = nthPalindromeBase[k, 9]; If[palQ[pp, 6], AppendTo[lst, pp]; Print[pp]]; k++]; lst
%t A259389 b1=6; b2=9; lst={}; Do[d1=IntegerDigits[n, b1]; d2=IntegerDigits[n, b2]; If[d1==Reverse[d1]&&d2==Reverse[d2], AppendTo[lst, n]], {n, 0, 1000000}]; lst (* _Vincenzo Librandi_, Jul 17 2015 *)
%Y A259389 Cf. A048268, A060792, A097856, A097928, A182232, A259374, A097929, A182233, A259375, A259376, A097930, A182234, A259377, A259378, A249156, A097931, A259380, A259381, A259382, A259383, A259384, A099145, A259385, A259386, A259387, A259388, A259389, A259390, A099146, A007632, A007633, A029961, A029962, A029963, A029964, A029804, A029965, A029966, A029967, A029968, A029969, A029970, A029731, A097855, A250408, A250409, A250410, A250411, A099165, A250412.
%K A259389 nonn,base
%O A259389 1,3
%A A259389 Eric A. Schmidt and _Robert G. Wilson v_, Jul 17 2015