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 A259382 #13 Aug 18 2015 12:57:29
%S A259382 0,1,2,3,5,63,65,105,130,170,195,235,325,341,357,373,4095,4097,4161,
%T A259382 4225,4289,6697,6761,6825,6889,8194,8258,8322,8386,10794,10858,10922,
%U A259382 10986,12291,12355,12419,12483,14891,14955,15019,15083,20485,20805,21525,21845
%N A259382 Palindromic numbers in bases 4 and 8 written in base 10.
%H A259382 Giovanni Resta, <a href="/A259382/b259382.txt">Table of n, a(n) for n = 1..10000</a>
%H A259382 <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>
%F A259382 Intersection of A014192 and A029803.
%e A259382 235 is in the sequence because 235_10 = 353_8 = 3223_4.
%t A259382 (* 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, 4], AppendTo[lst, pp]; Print[pp]]; k++]; lst
%t A259382 b1=4; b2=8; lst={}; Do[d1=IntegerDigits[n, b1]; d2=IntegerDigits[n, b2]; If[d1==Reverse[d1]&&d2==Reverse[d2], AppendTo[lst, n]], {n, 0, 30000}]; lst (* _Vincenzo Librandi_, Jul 17 2015 *)
%Y A259382 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 A259382 nonn,base
%O A259382 1,3
%A A259382 Eric A. Schmidt and _Robert G. Wilson v_, Jul 16 2015
%E A259382 Corrected and extended by _Giovanni Resta_, Jul 16 2015