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.

A287018 Primes that can be generated by the concatenation in base 2, in ascending order, of two consecutive integers read in base 10.

This page as a plain text file.
%I A287018 #12 May 24 2017 09:14:45
%S A287018 11,37,137,239,661,727,859,991,2081,2341,2731,2861,3121,3251,3511,
%T A287018 9547,10321,10837,11353,13159,13417,13933,14449,15739,34439,40093,
%U A287018 43177,43691,45233,46261,60139,61681,63737,135433,138511,139537,144667,146719,151849,154927
%N A287018 Primes that can be generated by the concatenation in base 2, in ascending order, of two consecutive integers read in base 10.
%e A287018 2 and 3 in base 2 are 10 and 11 and concat(10,11) = 1011 is 11 in base 10.
%e A287018 4 and 5 in base 2 are 100 and 101 and concat(100,101) = 100101 is 37 in base 10.
%p A287018 with(numtheory): P:= proc(q) local a,b,c,n; a:=convert(q+1,binary,decimal); b:=convert(q,binary,decimal); c:=convert(b*10^(ilog10(a)+1)+a,decimal,binary); if isprime(c) then c; fi; end: seq(P(i),i=1..1000);
%t A287018 Select[Map[FromDigits[Apply[Join, IntegerDigits[#, 2]], 2] &, Partition[Range@ 320, 2, 1]], PrimeQ] (* _Michael De Vlieger_, May 18 2017 *)
%o A287018 (PARI) lista(nn) = {for (n=1, nn, if (isprime(p=fromdigits(Vec(concat(binary(n), binary(n+1))), 2)), print1(p, ", ")));} \\ _Michel Marcus_, May 20 2017
%Y A287018 Cf. A000040, A030458, A287019.
%Y A287018 Subsequence of primes of A087737.
%K A287018 nonn,base,easy
%O A287018 1,1
%A A287018 _Paolo P. Lava_, May 18 2017