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.

A053434 Primes with digits in alphabetical order (in English).

This page as a plain text file.
%I A053434 #16 Feb 16 2025 08:32:42
%S A053434 2,3,5,7,11,13,17,41,43,47,53,59,73,83,89,97,113,163,173,433,443,449,
%T A053434 463,491,499,541,547,557,563,577,593,599,733,773,811,853,857,859,863,
%U A053434 877,881,883,887,911,977,991,997,1117,1163,1663,1733,1777,4111,4133,4177
%N A053434 Primes with digits in alphabetical order (in English).
%H A053434 Michael S. Branicky, <a href="/A053434/b053434.txt">Table of n, a(n) for n = 1..10000</a>
%H A053434 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WordSequence.html">Word Sequence</a>
%o A053434 (Python)
%o A053434 from sympy import isprime
%o A053434 from itertools import count, islice, combinations_with_replacement as cwr
%o A053434 def bgen(): # generator terms of A053432 not ending in 0 or 2
%o A053434     for d in count(1):
%o A053434         yield from sorted(int("".join(t)) for t in cwr("85491763", d))
%o A053434 def agen(): yield 2; yield from filter(isprime, bgen())
%o A053434 print(list(islice(agen(), 55))) # _Michael S. Branicky_, Aug 17 2022
%Y A053434 Intersection of primes and A053432.
%K A053434 easy,nonn,word,base
%O A053434 1,1
%A A053434 _G. L. Honaker, Jr._, Jan 10 2000