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.

A075050 Primes for which the eight closest primes are smaller.

This page as a plain text file.
%I A075050 #11 Feb 20 2022 12:24:03
%S A075050 15683,31397,43801,44293,89689,221101,248909,265621,282713,341357,
%T A075050 349423,370261,396733,399283,404851,440581,492113,517639,520451,
%U A075050 542603,544031,561109,566453,566567,576791,604073,626629,639757,673669,678659
%N A075050 Primes for which the eight closest primes are smaller.
%H A075050 Harvey P. Dale, <a href="/A075050/b075050.txt">Table of n, a(n) for n = 1..1000</a>
%e A075050 The eight closest primes to 15683 are 15679 (difference = 4), 15671 (difference = 12), 15667 (difference = 16), 15661 (difference = 22), 15649 (difference = 34), 15647 (difference = 36), 15643 (difference = 40) and 15641 (difference = 42). These are all smaller than 15683 so 15683 is in the list.
%t A075050 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; ps = {0, 0, 0, 0, 0, 0, 0, 0, 0, 1}; Do[ps = Drop[ps, 1]; ps = Append[ps, NextPrim[ ps[[ -1]]]]; If[ ps[[ -1]] - ps[[ -2]] > ps[[ -2]] - ps[[1]], Print[ ps[[ -2]]]], {n, 1, 58393}]
%t A075050 Select[Partition[Prime[Range[55000]],10,1],#[[9]]-#[[1]]<#[[10]]-#[[9]]&][[All,9]] (* _Harvey P. Dale_, Feb 20 2022 *)
%Y A075050 Cf. A001223, A074979, A074982, A075030, A075037, A075038, A075043 and A075051.
%K A075050 nonn
%O A075050 1,1
%A A075050 _Neil Fernandez_, Oct 10 2002
%E A075050 Edited and extended by _Robert G. Wilson v_, Oct 11 2002