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.

A007702 a(n) = prime(n)*...*prime(m), the least product of consecutive primes which is non-deficient.

This page as a plain text file.
%I A007702 #17 Jun 29 2019 21:03:53
%S A007702 6,15015,33426748355,1357656019974967471687377449,
%T A007702 7105630242567996762185122555313528897845637444413640621
%N A007702 a(n) = prime(n)*...*prime(m), the least product of consecutive primes which is non-deficient.
%H A007702 Amiram Eldar, <a href="/A007702/b007702.txt">Table of n, a(n) for n = 1..14</a>
%F A007702 a(n) = Product_{k = n..A007684(n)} prime(k) = Product_{0 <= i < A107705(n)} prime(n+i). - _M. F. Hasler_, Jun 15 2017
%t A007702 a[n_] := Module[{p = Prime[n]}, r = 1; prod = 1; While[r < 2, r *= 1 + 1/p; prod *= p; p = NextPrime[p]]; prod]; Array[a, 5] (* _Amiram Eldar_, Jun 29 2019 *)
%o A007702 (PARI) A007702(n, p=prime(n), s=1+1/p, P=p)={until(2<=s*=1+1/p,P*=p=nextprime(p+1));P} \\ _M. F. Hasler_, Jun 15 2017
%Y A007702 Cf. A005100, A007741, A007684, A007686.
%Y A007702 Cf. A107705, A108227, A285993.
%K A007702 nonn
%O A007702 1,1
%A A007702 _Walter Nissen_
%E A007702 More terms from _Don Reble_, Nov 10 2005