cp's OEIS Frontend

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.

A259388 Palindromic numbers in bases 5 and 9 written in base 10.

This page as a plain text file.
%I A259388 #12 Jul 22 2015 03:57:49
%S A259388 0,1,2,3,4,6,109,246,282,564,701,22386,32152,41667,47653,48553,
%T A259388 1142597,1313858,1412768,1677684,12607012902,19671459008,20134447808,
%U A259388 24208576998,24863844904,26358878059
%N A259388 Palindromic numbers in bases 5 and 9 written in base 10.
%H A259388 Giovanni Resta, <a href="/A259388/b259388.txt">Table of n, a(n) for n = 1..40</a>
%H A259388 <a href="/index/Pac#palindromes">Index entries for sequences related to palindromes</a>
%F A259388 Intersection of A029952 and A029955.
%e A259388 246 is in the sequence because 246_10 = 303_9 = 1441_5.
%t A259388 (* 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, 5], AppendTo[lst, pp]; Print[pp]]; k++]; lst
%t A259388 b1=5; b2=9; 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 A259388 Cf. A007632, A007633, A029731, A029804, A029961, A029962, A029963, A029964, A029965, A029966, A029967, A029968, A029969, A029970, A048268, A060792, A097855, A097856, A097928, A097929, A097930, A097931, A099145, A099146, A099165, A182232, A182233, A182234, A250408, A250409, A250410, A250411, A250412, A259374, A259375, A259376, A259377, A259378, A249156, A259380, A259381, A259382, A259383, A259384, A259385, A259386, A259387, A259388, A259389, A259390.
%K A259388 nonn,base
%O A259388 1,3
%A A259388 _Robert G. Wilson v_, Jul 16 2015