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.

A378201 a(n) = 2*n mod q, where q is the greatest prime such that 2*n - q is also prime.

This page as a plain text file.
%I A378201 #7 Dec 03 2024 12:47:09
%S A378201 0,0,3,3,5,3,3,5,3,3,5,3,5,7,3,3,5,7,3,5,3,3,5,3,5,7,3,5,7,3,3,5,7,3,
%T A378201 5,3,3,5,7,3,5,3,5,7,3,5,7,19,3,5,3,3,5,3,3,5,3,5,7,13,11,13,19,3,5,3,
%U A378201 5,7,3,3,5,7,11,11,3,3,5,7,3,5,7,3,5,3,5,7,3,5,7,3,3,5,7,11,11,3,3,5
%N A378201 a(n) = 2*n mod q, where q is the greatest prime such that 2*n - q is also prime.
%t A378201 Table[Module[{p = 2, q},
%t A378201   While[True, q = 2 n - p; If[PrimeQ[p] && PrimeQ[q], Break[]];
%t A378201    p = NextPrime[p]]; Mod[2 n, q]], {n, 2, 100}]
%Y A378201 Cf. A002373.
%K A378201 nonn
%O A378201 2,3
%A A378201 _Michel Eduardo Beleza Yamagishi_, Nov 19 2024