OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..3000
Felice Russo, On a problem concerning the Smarandache friendly prime pairs.
MAPLE
Primes:= [seq(ithprime(i), i=1..1000)]:
S:= ListTools:-PartialSums(Primes):
f:= proc(n) local m, t;
for m from n do if S[m] > S[n-1] + Primes[n]*Primes[m] then return m-1 fi od
end proc:
f(1):= 3:
map(f, [$1..100]); # Robert Israel, Aug 08 2019
MATHEMATICA
f[n_] := Block[{k = n, s = 0, a = Prime[n]}, While[b = Prime[k]; s = s + b; a*b >= s, k++ ]; k--; k]; Table[ f[n], {n, 1, 55}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Roger L. Bagula, Oct 02 2002
EXTENSIONS
Edited by N. J. A. Sloane and Robert G. Wilson v, Oct 04 2002
Corrected by Robert Israel, Aug 08 2019
STATUS
approved