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.

A074928 a(n)>0 such that p(n)*p(n+1)+a(n) is a minimal prime.

This page as a plain text file.
%I A074928 #15 Mar 17 2025 08:17:41
%S A074928 1,2,2,2,6,2,8,2,6,8,4,6,14,6,12,10,8,4,2,6,12,6,6,8,6,24,6,14,6,18,
%T A074928 12,10,8,6,2,12,10,18,10,4,2,12,8,18,6,10,4,6,8,2,4,2,2,6,10,6,2,12,2,
%U A074928 8,20,8,2,24,2,6,30,14,20,6,6,6,6,4,20,4,6,2,2,12,2,6,6,6,2,22,8,32,6,12
%N A074928 a(n)>0 such that p(n)*p(n+1)+a(n) is a minimal prime.
%C A074928 a(n) is even for n > 1. - _Seiichi Manyama_, Mar 17 2025
%H A074928 Seiichi Manyama, <a href="/A074928/b074928.txt">Table of n, a(n) for n = 1..10000</a>
%e A074928 a(1) = 1 because p(1)*p(2) + 1 = 2*3 + 1 = 7 -> prime
%t A074928 NextPrime[#]-#&/@Times@@@Partition[Prime[Range[100]],2,1] (* _Harvey P. Dale_, May 28 2013 *)
%Y A074928 Cf. A107019, A107057, A107058.
%K A074928 nonn
%O A074928 1,2
%A A074928 _Zak Seidov_, Oct 02 2002