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.

A352002 a(n) = prime(n)# + prime(n), where prime(n)# is the n-th primorial number A002110(n).

This page as a plain text file.
%I A352002 #24 Mar 11 2022 13:12:58
%S A352002 4,9,35,217,2321,30043,510527,9699709,223092893,6469693259,
%T A352002 200560490161,7420738134847,304250263527251,13082761331670073,
%U A352002 614889782588491457,32589158477190044783,1922760350154212639129,117288381359406970983331,7858321551080267055879157,557940830126698960967415461
%N A352002 a(n) = prime(n)# + prime(n), where prime(n)# is the n-th primorial number A002110(n).
%F A352002 a(n) = A002110(n) +  A000040(n). Also a(n) = prime(n) * (prime(n-1)# + 1).
%e A352002 a(3) = prime(3)# + prime(3) = 2 * 3 * 5 + 5 = 35.
%o A352002 (PARI) a(n) = prime(n) + prod(k=1, n, prime(k)); \\ _Michel Marcus_, Feb 28 2022
%o A352002 (Python)
%o A352002 from sympy import primorial, prime
%o A352002 def a(n): return primorial(n) + prime(n)
%o A352002 for n in range(1,50):
%o A352002     print(a(n), end=", ") # _Javier Rivera Romeu_, Mar 01 2022
%Y A352002 Cf. A000040, A002110.
%K A352002 nonn
%O A352002 1,1
%A A352002 _Ryan Bresler_, Feb 27 2022