|
Search: id:A075703
|
|
|
| A075703 |
|
a(n) = minimal m such that Sum [ Prime[k],{k,n,m}] >= Prime[n]*Prime[m]. |
|
+0
2
|
|
| 3, 6, 11, 16, 25, 28, 38, 43, 51, 64, 70, 83, 90, 95, 105, 117, 131, 134, 148, 158, 161, 174, 182, 196, 212, 225, 228, 235, 238, 248, 277, 287, 302, 305, 325, 332, 343, 355, 364, 380, 391, 394, 414, 419, 428, 433, 463, 486, 495, 498, 506, 519, 524, 544, 556
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
Felice Russo, On a problem concerning the Smarandache friendly prime pairs.
|
|
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
|
Cf. A074968.
Sequence in context: A116940 A159944 A087099 this_sequence A034029 A034031 A065504
Adjacent sequences: A075700 A075701 A075702 this_sequence A075704 A075705 A075706
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 02 2002
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 04 2002
|
|
|
Search completed in 0.002 seconds
|
