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.

A363017 a(n) is the least integer k such that the k-th, (k+1)-th, ..., (k+n-1)-th primes are congruent to 3 mod 8.

This page as a plain text file.
%I A363017 #28 May 28 2023 15:40:45
%S A363017 2,94,334,4422,23969,303493,303493,606529,28725046,92865581,397316305,
%T A363017 511883558,848516256,23738949809,144899085865,469694200388,
%U A363017 3800553021301,8571139291304,63858322306341,90990757864814
%N A363017 a(n) is the least integer k such that the k-th, (k+1)-th, ..., (k+n-1)-th primes are congruent to 3 mod 8.
%C A363017 a(n) is also the minimal rank where n consecutive 2's appear in A023512.
%C A363017 The sequence is infinite by Shiu's theorem.
%F A363017 a(n) = primepi(A057632(n)). - _Amiram Eldar_, May 13 2023
%e A363017 For n=2, a(2) = 94 because prime(94)+1 = 492 = 4*123, prime(95)+1 = 500 = 4*125 are the first two consecutive primes p such that p+1 is divisible by 4 and not by 8.
%Y A363017 Cf. A057632, A023512.
%Y A363017 Cf. A363016 (with 1 mod 4).
%K A363017 nonn,more
%O A363017 1,1
%A A363017 _Léo Gratien_, May 13 2023
%E A363017 a(19)-a(20) from _Martin Ehrenstein_, May 28 2023