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.

A084837 Palindromic primes with nonincreasing digits up to the middle and then nondecreasing.

This page as a plain text file.
%I A084837 #11 Jun 27 2022 01:52:53
%S A084837 2,3,5,7,11,101,313,727,757,919,929,31013,72227,73037,73237,74047,
%T A084837 75557,76367,76667,77377,77477,91019,93139,93239,94049,94349,96269,
%U A084837 96469,97379,97579,98389,98689,3211123,3222223,3310133,3321233,3331333,7100017,7300037,7310137
%N A084837 Palindromic primes with nonincreasing digits up to the middle and then nondecreasing.
%H A084837 Michael S. Branicky, <a href="/A084837/b084837.txt">Table of n, a(n) for n = 1..10000</a>
%H A084837 Patrick De Geest, <a href="http://www.worldofnumbers.com/palpri.htm">World of Palindromic Primes</a>
%o A084837 (Python)
%o A084837 from sympy import isprime
%o A084837 from itertools import count, islice, combinations_with_replacement as mc
%o A084837 def agen(): # generator of terms
%o A084837     yield from (2, 3, 5, 7, 11)
%o A084837     for d in count(2):
%o A084837         nind = (int("".join(m+m[:-1][::-1])) for m in mc("9876543210", d))
%o A084837         yield from sorted(filter(isprime, nind))
%o A084837 print(list(islice(agen(), 40))) # _Michael S. Branicky_, Jun 26 2022
%Y A084837 Cf. A084836, A062351, A062352.
%K A084837 nonn,base
%O A084837 1,1
%A A084837 _Patrick De Geest_, Jun 07 2003
%E A084837 a(38) and beyond from _Michael S. Branicky_, Jun 26 2022