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.

A163112 Prime numbers with gaps larger than 20 towards both neighboring primes.

This page as a plain text file.
%I A163112 #18 May 14 2022 11:24:28
%S A163112 16033,16787,18013,23719,24281,29101,32749,33247,33679,33997,37747,
%T A163112 38501,40063,40387,42533,42611,44417,46957,51109,51383,53479,54217,
%U A163112 55291,55763,56333,56569,58271,58511,58831,59833,61441,61781,62273,66137,66271,69593,69623
%N A163112 Prime numbers with gaps larger than 20 towards both neighboring primes.
%C A163112 Subsequence of A163111.
%H A163112 Harvey P. Dale, <a href="/A163112/b163112.txt">Table of n, a(n) for n = 1..10000</a>
%H A163112 <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>
%F A163112 {A000040(i) : A001223(i) > 20 and A001223(i-1) > 20}. - _R. J. Mathar_, Jul 27 2009
%p A163112 p := 2; q := 3; r := 3; for n from 2 to 15000 do if q-p > 20 and r-q > 20 then printf("%d,",q) ; fi; p := q; q := r; r := nextprime(r) ; od: # _R. J. Mathar_, Jul 27 2009
%t A163112 Select[Partition[Prime[Range[7000]],3,1],Min[Differences[#]]>20&] [[All, 2]] (* _Harvey P. Dale_, Mar 16 2017 *)
%Y A163112 Cf. A137875, A137874, A137873, A137872, A137871, A163111.
%K A163112 nonn
%O A163112 1,1
%A A163112 _Vladimir Joseph Stephan Orlovsky_, Jul 20 2009
%E A163112 Definition rephrased by _R. J. Mathar_, Jul 27 2009