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.

A050674 Inserting a digit '0' between adjacent digits of n makes a prime.

Original entry on oeis.org

11, 13, 17, 19, 37, 41, 49, 53, 59, 61, 67, 71, 79, 89, 97, 107, 109, 113, 131, 133, 151, 161, 167, 179, 193, 199, 211, 217, 221, 247, 257, 259, 277, 287, 289, 293, 313, 319, 323, 337, 343, 359, 373, 377, 383, 389, 409, 457, 469, 479, 481, 493, 511, 527, 553
Offset: 1

Views

Author

Patrick De Geest, Aug 15 1999

Keywords

Examples

			373 becomes 3(0)7(0)3 which is prime 30703.
		

Crossrefs

Programs

  • Mathematica
    (* This program works in Mathematica 6.0 and later *)
    Select[Range[11, 1000,2], PrimeQ[FromDigits[Riffle[IntegerDigits[#], 0]]] &] (* T. D. Noe, Dec 22 2010 *)
    (* The following program has been tested in Mathematica 5.1 and it works *)
    Reap[c = 0; d = 0; Do[If[MemberQ[{1, 3, 7, 9}, Mod[n, 10]], id = IntegerDigits[n]; Do[id[[k]] = {id[[k]], d}, {k, Length[id] - 1}]; If[PrimeQ[FromDigits[Flatten[id]]], Sow[n]; c++; If[c > 999, Break[]]]], {n, 11, 20000}]][[2,1]] (* Zak Seidov, Dec 22 2010 *)

Extensions

Offset set to 1 by Georg Fischer, Oct 15 2019