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.

A373626 Least prime of a run of n consecutive primes p_i, i = 1..n, such that bigomega(p_i + 1) = omega(p_i + 1) + i and bigomega(p_(n+1) + 1) <> omega(p_(n+1) + 1) + n + 1, or -1 if no such prime exists.

This page as a plain text file.
%I A373626 #28 Jul 07 2024 13:03:36
%S A373626 3,19,739,76913,4510333,746264059,290623032907
%N A373626 Least prime of a run of n consecutive primes p_i, i = 1..n, such that bigomega(p_i + 1) = omega(p_i + 1) + i and bigomega(p_(n+1) + 1) <> omega(p_(n+1) + 1) + n + 1, or -1 if no such prime exists.
%e A373626 19 starts a run of 2 consecutive primes 19 and 23, bigomega(19+1) = 2 = omega(19+1) + 1, bigomega(23+1) = 4 = omega(23+1) + 2 and bigomega(29+1) = 3 <> omega(29+1) + 3. So a(2) = 19.
%e A373626 Let i, p, b and w be the indices, the primes p_i, bigomega(p_i + 1) and omega(p_i + 1).
%e A373626 i: [ 1  2  3]
%e A373626 p: [19 23 29]
%e A373626 b: [ 3  4  3]
%e A373626 w: [ 2  2  3]
%e A373626 a(2) = 19
%e A373626 i: [  1   2   3   4]
%e A373626 p: [739 743 751 757]
%e A373626 b: [  4   5   5   2]
%e A373626 w: [  3   3   2   2]
%e A373626 a(3) = 739
%Y A373626 Cf. A001221, A001222, A072875, A086560, A369097, A373618.
%K A373626 nonn,more
%O A373626 1,1
%A A373626 _Jean-Marc Rebert_, Jun 11 2024