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.

A050711 Inserting a digit '1' between adjacent digits of n makes a prime.

This page as a plain text file.
%I A050711 #18 Oct 15 2019 12:14:51
%S A050711 13,21,31,33,37,49,63,67,69,79,81,91,99,113,117,119,123,131,137,141,
%T A050711 159,167,177,179,183,201,203,207,209,221,233,237,239,249,257,261,263,
%U A050711 267,273,287,291,303,309,329,339,351,353,357,387,401,407,413,417,423
%N A050711 Inserting a digit '1' between adjacent digits of n makes a prime.
%H A050711 Harvey P. Dale, <a href="/A050711/b050711.txt">Table of n, a(n) for n = 1..1001</a>
%e A050711 303 becomes 3(1)0(1)3 which is prime 31013.
%t A050711 Select[Range[10,500],PrimeQ[FromDigits[Riffle[IntegerDigits[#],1]]]&] (* _Harvey P. Dale_, Apr 25 2019 *)
%o A050711 (PARI) is(n) = if(gcd(10, n%10) > 1 || n < 10, return(0)); my(d = digits(n), v = vector(2*#d - 1, i, if(i % 2 == 1, d[i>>1 + 1], 1))); isprime(fromdigits(v)) \\ _David A. Corneth_, Oct 15 2019
%Y A050711 Cf. A050674, A050712, A050713, A050714, A050715, A050716, A050717, A050718, A050719.
%K A050711 nonn,base
%O A050711 1,1
%A A050711 _Patrick De Geest_, Aug 15 1999
%E A050711 Offset set to 1 by _Georg Fischer_, Oct 15 2019