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.
%I A374914 #11 Jul 25 2024 14:05:58 %S A374914 2,3,11,23,83,131,179,191,239,251,359,419,431,443,491,659,683,719,743, %T A374914 911,1019,1031,1103,1223,1439,1451,1499,1511,1559,1583,1811,1931,2003, %U A374914 2039,2063,2339,2351,2399,2459,2543,2699,2819,2903,2939,2963,3023,3299,3359,3491 %N A374914 Primes p == 2, 3 (mod 4) with 2*p+1 prime. %C A374914 2 together with Lucasian primes (A002515). %C A374914 Primes p such that p^(p + 1) == p + 1 (mod 2*p + 1). %F A374914 a(n) >> n log^2 n. - _Charles R Greathouse IV_, Jul 25 2024 %e A374914 2 is in this sequence because 2^(2 + 1) = 8 and 8 = 3 (mod 2*2 + 1) where 2 prime. %t A374914 Select[Prime[Range[490]],Mod[#^(#+1),2#+1]==#+1 &] (* _Stefano Spezia_, Jul 23 2024 *) %o A374914 (PARI) list(lim)=my(v=List([2])); forprimestep(p=3,lim\1,4, if(isprime(2*p+1), listput(v,p))); Vec(v) \\ _Charles R Greathouse IV_, Jul 25 2024 %Y A374914 Supersequence of A002515. Subsequence of A374913. %Y A374914 Cf. A374912. %K A374914 nonn,easy %O A374914 1,1 %A A374914 _Juri-Stepan Gerasimov_, Jul 23 2024