cp's OEIS Frontend

A379405 a(n) = p((n+1)*p(n)), where p(x) = least prime > x; i.e., p = A151800.

%I A379405 #23 Jan 21 2025 18:20:14
%S A379405 3,5,11,23,29,43,53,89,101,113,127,157,173,239,257,277,293,347,367,
%T A379405 461,487,509,541,701,727,757,787,821,853,937,967,1187,1223,1259,1297,
%U A379405 1361,1373,1559,1601,1657,1693,1811,1861,2069,2129,2179,2213,2549,2609,2657
%N A379405 a(n) = p((n+1)*p(n)), where p(x) = least prime > x; i.e., p = A151800.
%H A379405 Michael De Vlieger, <a href="/A379405/b379405.txt">Table of n, a(n) for n = 0..10000</a>
%F A379405 a(n) = A151800(A053024(n+1)). - _Alois P. Heinz_, Jan 18 2025
%e A379405 p(1) = 2, so a(1) = p(2*p(1)) = 5.
%t A379405 Table[NextPrime[(n+1)*NextPrime[n]], {n, 0, 80}]
%o A379405 (PARI) p(n) = nextprime(n+1);
%o A379405 a(n) = p((n+1)*p(n)); \\ _Michel Marcus_, Jan 18 2025
%o A379405 (Python)
%o A379405 from sympy import nextprime
%o A379405 def A379405(n): return nextprime((n+1)*nextprime(n)) # _Chai Wah Wu_, Jan 20 2025
%Y A379405 Cf. A000040, A053024, A151800, A378135, A378136, A378137.
%K A379405 nonn
%O A379405 0,1
%A A379405 _Clark Kimberling_, Jan 18 2025