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.

A107058 a(n) = smallest number m>0 such that prime(n)*prime(n+1)-m is a prime.

This page as a plain text file.
%I A107058 #11 Mar 17 2025 08:17:57
%S A107058 1,2,4,4,4,10,6,4,6,12,18,6,4,4,14,6,6,8,6,4,18,4,18,4,6,4,18,6,16,4,
%T A107058 4,8,6,4,16,18,2,10,12,18,18,22,6,10,4,6,2,22,6,4,6,6,34,8,2,18,6,26,
%U A107058 24,30,6,12,6,16,30,10,8,6,22,6,8,4,2,8,18,26,10,4,12,30,10,12,4,24,6,6,6
%N A107058 a(n) = smallest number m>0 such that prime(n)*prime(n+1)-m is a prime.
%C A107058 a(n) is even for n > 1. - _Seiichi Manyama_, Mar 17 2025
%H A107058 Seiichi Manyama, <a href="/A107058/b107058.txt">Table of n, a(n) for n = 1..10000</a>
%o A107058 (PARI) a(n) = { my(m=0, v = prime(n)*prime(n+1)); while (! isprime(v-m), m++;); return (m);} \\ _Michel Marcus_, Apr 19 2013
%Y A107058 Cf. A107059: records in A107058; A106172: positions of records in A107058. Cf. A074928: a(n)>0 such that p(n)*p(n+1)+a(n) is a smallest prime.
%Y A107058 Cf. A074928, A107019, A107057, A107059, A106172.
%K A107058 nonn
%O A107058 1,2
%A A107058 _Zak Seidov_, May 10 2005