cp's OEIS Frontend

A210481 Given n-th prime p, a(n) = number of primes of the form p * q - 2 where q is any prime < p.

%I A210481 #52 Jul 19 2020 18:25:36
%S A210481 0,0,1,1,2,2,1,1,4,2,2,4,3,2,4,3,4,3,4,4,6,3,4,5,3,5,5,4,3,6,4,7,5,4,
%T A210481 6,5,7,9,7,5,6,5,6,6,8,5,7,9,5,6,7,5,7,7,9,10,3,11,8,11,6,9,8,12,8,9,
%U A210481 7,10,9,7,8,8,6,14,8,10,11,11,12,11,7,7
%N A210481 Given n-th prime p, a(n) = number of primes of the form p * q - 2 where q is any prime < p.
%C A210481 Very similar to A103960. - _T. D. Noe_, Apr 18 2013
%C A210481 a(A137291(n)) = A103960(A137291(n)) - 1. - _Reinhard Zumkeller_, Jul 30 2015
%H A210481 Reinhard Zumkeller, <a href="/A210481/b210481.txt">Table of n, a(n) for n = 1..1000</a>
%t A210481 Table[p = Prime[n]; c = 0; Do[If[PrimeQ[p*Prime[i] - 2], c = c + 1], {i, n - 1}]; c, {n, 82}]
%t A210481 Table[With[{pr=Prime[Range[n]]},Count[Most[pr]Last[pr]-2,_?PrimeQ]],{n,90}] (* _Harvey P. Dale_, Jul 19 2020 *)
%o A210481 (Haskell)
%o A210481 a210481 n = sum [a010051' $ p * q - 2 |
%o A210481                  let p = a000040 n, q <- takeWhile (< p) a000040_list]
%o A210481 -- _Reinhard Zumkeller_, Jul 30 2015
%Y A210481 Cf. A103960, A224748.
%Y A210481 Cf. A010051, A000040, A103960, A137291.
%K A210481 nonn
%O A210481 1,5
%A A210481 _Jayanta Basu_, Apr 18 2013