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.

A020449 Primes whose greatest digit is 1.

This page as a plain text file.
%I A020449 #68 May 13 2025 00:58:39
%S A020449 11,101,10111,101111,1011001,1100101,10010101,10011101,10100011,
%T A020449 10101101,10110011,10111001,11000111,11100101,11110111,11111101,
%U A020449 100100111,100111001,101001001,101001011,101100011,101101111,101111011,101111111
%N A020449 Primes whose greatest digit is 1.
%C A020449 Primes which are the sums of distinct powers of 10. - _Amarnath Murthy_, Nov 19 2002
%C A020449 Subsequence of A007088. - _Michel Marcus_, Dec 18 2015
%C A020449 These numbers are called Anti-Yarborough prime numbers in the Prime Glossary. - _Randy L. Ekl_, Jan 19 2019
%H A020449 Jon E. Schoenfield, <a href="/A020449/b020449.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)
%H A020449 C. K. Caldwell, The Prime Glossary, <a href="https://primes.utm.edu/glossary/page.php?sort=YarboroughPrime">Yarborough prime</a>.
%H A020449 FactorDB, <a href="https://factordb.com/index.php?id=1100000008211539106">Concatenation of first 35 terms is prime</a>
%H A020449 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%p A020449 N:= 10: # to get all entries with <= N digits
%p A020449 S:= {}:
%p A020449 for d from 1 to N-1 do
%p A020449   S:= S union select(isprime,map(`+`,map(convert,combinat[powerset]({seq(10^i,i=0..d-1)}),`+`),10^d));
%p A020449 od:
%p A020449 S; # if using Maple 11 or earlier, uncomment the next line
%p A020449 # sort(convert(%,list)); # _Robert Israel_, May 04 2015
%t A020449 Select[FromDigits/@Tuples[{0,1},16],PrimeQ] (* _Hans Havermann_, May 12 2025 *)
%o A020449 (Magma) [p: p in PrimesUpTo(101111111) | Set(Intseq(p)) subset [0,1]]; // _Vincenzo Librandi_, Jul 27 2012
%o A020449 (PARI) is(n)=isprime(n)&&vecmax(digits(n))==1 \\ _Charles R Greathouse IV_, Jul 01 2013
%o A020449 (Python)
%o A020449 from sympy import isprime
%o A020449 A020449_list = [n for n in (int(format(m,'b')) for m in range(1,2**10)) if isprime(n)] # _Chai Wah Wu_, Dec 17 2015
%Y A020449 Subsequence of A036953.
%Y A020449 Cf. A007088, A036952.
%K A020449 nonn,base
%O A020449 1,1
%A A020449 _David W. Wilson_