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.

A307176 Number of Sophie Germain primes of the form 4k + 1 less than 10^n.

This page as a plain text file.
%I A307176 #32 Jun 06 2019 15:32:29
%S A307176 1,5,17,89,589,3833,27940,211439,1653257,13283194,109058142,911411528,
%T A307176 7731354496
%N A307176 Number of Sophie Germain primes of the form 4k + 1 less than 10^n.
%C A307176 Sophie Germain primes can alternatively be Lucasian primes, primes of the form 4k + 1, or, the individual prime 2.
%F A307176 a(n) < A092816(n).
%F A307176 a(n) <= A091098(n) (with equality for n = 1).
%F A307176 a(n) = A092816(n) - A307121(n) - 1.
%e A307176 There are five Sophie Germain Primes of the form 4k + 1 below 10^2: {5, 29, 41, 53, 89}, therefore a(2) = 5.
%t A307176 nonLucSophies = Select[4Range[2500000] + 1, PrimeQ[#] && PrimeQ[2# + 1] &]; Table[Length[Select[nonLucSophies, # < 10^n &]], {n, 0, 7}]
%Y A307176 Cf. A091098, A092816, A002515, A307121, A002144, A005384, A103579.
%K A307176 nonn,more
%O A307176 1,2
%A A307176 _Rodolfo Ruiz-Huidobro_, Mar 27 2019