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.

A030096 Primes whose digits are all odd.

This page as a plain text file.
%I A030096 #39 Nov 18 2024 11:12:58
%S A030096 3,5,7,11,13,17,19,31,37,53,59,71,73,79,97,113,131,137,139,151,157,
%T A030096 173,179,191,193,197,199,311,313,317,331,337,353,359,373,379,397,557,
%U A030096 571,577,593,599,719,733,739,751,757,773,797,911,919,937,953,971,977,991
%N A030096 Primes whose digits are all odd.
%H A030096 Seiichi Manyama, <a href="/A030096/b030096.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from T. D. Noe)
%t A030096 Select[Prime[Range[500]],And@@OddQ[IntegerDigits[#]]&] (* _Harvey P. Dale_, Jan 28 2013 *)
%o A030096 (Haskell)
%o A030096 a030096 n = a030096_list !! (n-1)
%o A030096 a030096_list = filter f a000040_list where
%o A030096    f x = odd d && (x < 10 || f x') where (x', d) = divMod x 10
%o A030096 -- _Reinhard Zumkeller_, Apr 07 2014, Jan 29 2013
%o A030096 (PARI) is(n)=isprime(n) && #setintersect([0,2,4,6,8],Set(digits(n)))==0 \\ _Charles R Greathouse IV_, Feb 07 2017
%o A030096 (Magma) [p: p in PrimesUpTo(1000) | forall{d: d in [0,2,4,6,8] | d notin Set(Intseq(p))}]; // _Vincenzo Librandi_, Apr 29 2019
%Y A030096 Intersection of A000040 and A014261. Subsequence of A066640 and hence A014261. Subsequence of A038604. A091633 is a subsequence.
%Y A030096 Cf. A076704 = odd-digit prime powers of prime numbers; A091296 = odd-digit semiprimes; A000040 = prime numbers; A001358 = semiprimes.
%K A030096 nonn,base,nice
%O A030096 1,1
%A A030096 _Patrick De Geest_
%E A030096 Edited by _N. J. A. Sloane_ at the suggestion of _T. D. Noe_ and _Jonathan Vos Post_, Sep 15 2007