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

%I #17 Jun 29 2019 21:03:53

%S 6,15015,33426748355,1357656019974967471687377449,

%T 7105630242567996762185122555313528897845637444413640621

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

%H Amiram Eldar, <a href="/A007702/b007702.txt">Table of n, a(n) for n = 1..14</a>

%F a(n) = Product_{k = n..A007684(n)} prime(k) = Product_{0 <= i < A107705(n)} prime(n+i). - _M. F. Hasler_, Jun 15 2017

%t 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 (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 Cf. A005100, A007741, A007684, A007686.

%Y Cf. A107705, A108227, A285993.

%K nonn

%O 1,1

%A _Walter Nissen_

%E More terms from _Don Reble_, Nov 10 2005