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 A259381 #11 Aug 18 2015 12:57:29
%S A259381 0,1,2,4,121,130,203,316,8578,9490,17492,944035,1141652,1276916,
%T A259381 1554173,58961443,67470916,4099065139,5691134677,81452592329,
%U A259381 81473867465,419572845958,21056462595764,363376288168081
%N A259381 Palindromic numbers in bases 3 and 8 written in base 10.
%H A259381 Giovanni Resta, <a href="/A259381/b259381.txt">Table of n, a(n) for n = 1..43</a>
%H A259381 <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>
%F A259381 Intersection of A014190 and A029803.
%e A259381 121 is in the sequence because 121_10 = 171_8 = 11111_3.
%t A259381 (* 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, 8]; If[palQ[pp, 3], AppendTo[lst, pp]; Print[pp]]; k++]; lst
%t A259381 b1=3; b2=8; lst={}; Do[d1=IntegerDigits[n, b1]; d2=IntegerDigits[n, b2]; If[d1==Reverse[d1]&&d2==Reverse[d2], AppendTo[lst, n]], {n, 0, 10000000}]; lst (* _Vincenzo Librandi_, Jul 17 2015 *)
%Y A259381 Cf. A048268, A060792, A097856, A097928, A182232, A259374, A097929, A182233, A259375, A259376,
%Y A259381 A097930, A182234, A259377, A259378, A249156, A097931, A259380, A259381, A259382, A259383,
%Y A259381 A259384, A099145, A259385, A259386, A259387, A259388, A259389, A259390, A099146, A007632,
%Y A259381 A007633, A029961, A029962, A029963, A029964, A029804, A029965, A029966, A029967, A029968,
%Y A259381 A029969, A029970, A029731, A097855, A250408, A250409, A250410, A250411, A099165, A250412.
%K A259381 nonn,base
%O A259381 1,3
%A A259381 Eric A. Schmidt and _Robert G. Wilson v_, Jul 16 2015