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.

A103403 Palindromic primes q derived from palindromes p such that pi(p) = q.

This page as a plain text file.
%I A103403 #15 Sep 12 2019 01:54:29
%S A103403 2,2,3,3,5,11,101,151,757,797,72727,3485843,7362637,753535357,
%T A103403 32792329723,1644209024461,9600458540069,125319848913521,
%U A103403 164957666759461
%N A103403 Palindromic primes q derived from palindromes p such that pi(p) = q.
%C A103403 From a suggestion from _Zak Seidov_, Feb 02 2005.
%C A103403 a(16) > pi(32*10^12). - _Donovan Johnson_, Dec 03 2009
%t A103403 NextPalindrome[n_] := Block[ {l = Floor[ Log[10, n] + 1], idn = IntegerDigits[n]}, If[ Union[ idn] == {9}, Return[n + 2], If[l < 2, Return[n + 1], If[ FromDigits[ Reverse[ Take[ idn, Ceiling[l/2]]]] FromDigits[ Take[ idn, -Ceiling[l/2]]], FromDigits[ Join[ Take[ idn, Ceiling[l/2]], Reverse[ Take[ idn, Floor[l/2]]] ]], idfhn = FromDigits[ Take[ idn, Ceiling[l/2]]] + 1; idp = FromDigits[ Join[ IntegerDigits[ idfhn], Drop[ Reverse[ IntegerDigits[ idfhn]], Mod[l, 2]]]] ]]]];
%t A103403 p = 0; a = {}; Do[p = NextPalindrome[p]; q = PrimePi[p]; If[PrimeQ[q], r = IntegerDigits[q]; If[Reverse[r] == r, Print[{p, q}]; AppendTo[a, q]]], {n, 10^6}]; a
%t A103403 palQ[n_] := Reverse[x = IntegerDigits[n]] == x; t = {}; Do[If[palQ[n] && PrimeQ[y = PrimePi[n]] && palQ[y], AppendTo[t, y]], {n,10^6}]; t (* _Jayanta Basu_, Jun 24 2013 *)
%Y A103403 Cf. A046941, A046942, A103357, A103358, A103402.
%K A103403 nonn,base,more
%O A103403 1,1
%A A103403 _Robert G. Wilson v_, Feb 03 2005
%E A103403 a(15) from _Donovan Johnson_, Dec 03 2009
%E A103403 a(16)-a(17) from _Chai Wah Wu_, Sep 04 2019
%E A103403 a(18)-a(19) from _Giovanni Resta_, Sep 12 2019