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.

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Zak Seidov, Oct 02 2002

Keywords

Comments

a(n) is even for n > 1. - Seiichi Manyama, Mar 17 2025

Examples

			a(1) = 1 because p(1)*p(2) + 1 = 2*3 + 1 = 7 -> prime
		

Crossrefs

Programs

  • Mathematica
    NextPrime[#]-#&/@Times@@@Partition[Prime[Range[100]],2,1] (* Harvey P. Dale, May 28 2013 *)