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.

A073034 Take A000040, omit commas: 23571113171923..., select 1-digit primes.

Original entry on oeis.org

2, 3, 5, 7, 3, 7, 2, 3, 2, 3, 3, 7, 3, 7, 5, 3, 5, 7, 7, 7, 3, 7, 3, 7, 3, 7, 3, 2, 7, 3, 3, 7, 3, 5, 5, 7, 3, 7, 7, 3, 7, 3, 7, 2, 2, 2, 3, 2, 2, 7, 2, 2, 2, 3, 3, 2, 3, 2, 2, 5, 2, 5, 7, 2, 3, 2, 2
Offset: 1

Views

Author

Zak Seidov, Aug 22 2002

Keywords

Examples

			In the sequence 2357111317192329... (primes without delimiters) one-digit primes are 2,3,5,7,3,7,2,3,2...
		

Crossrefs

Programs

  • Haskell
    a073034 n = a073034_list !! (n-1)
    a073034_list = filter (`elem` [2,3,5,7]) a033308_list
    -- Reinhard Zumkeller, Mar 11 2014
  • Mathematica
    p200=Flatten[IntegerDigits[Prime[Range[200]]]]; n=4; (* n-digit primes!*) pn=Partition[p200, n, 1]; ln=Length[pn]; tab=Table[Sum[10^(n-k)*pn[[i, k]], {k, n}], {i, ln}]; Select[tab, PrimeQ]