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.

A152033 a(n) is the least n-digit prime p whose reversal is a prime q < p.

Original entry on oeis.org

31, 311, 1201, 11701, 106501, 1020101, 10021001, 100440001, 1000200001, 10003810001, 100011400001, 1000039200001, 10000084000001, 100000381000001, 1000001790000001, 10000004700000001, 100000033900000001, 1000000101700000001, 10000000484400000001, 100000001019000000001
Offset: 2

Views

Author

Zak Seidov, Nov 20 2008

Keywords

Crossrefs

Subsequence of A109309.

Programs

  • Mathematica
    Do[ p = NextPrime[10^(n - 1) ]; Do[ p1 = FromDigits[ Reverse[IntegerDigits[p]]]; If[PrimeQ[p1] && p1 < p, Print[{n, p}]; Break[]]; p = NextPrime[p], {10^9}], {n, 2, 16}];

Extensions

a(17)-a(21) from Chai Wah Wu, Sep 11 2019