login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074968 a(n) = minimal m such that Sum [ Prime[k],{k,1,m}] >= Prime[n]*Prime[m]. 1

%I #2 Mar 30 2012 17:30:50

%S 3,5,10,15,25,28,38,41,51,64,69,82,89,94,104,116,130,133,147,156,160,

%T 173,181,195,211,224,227,234,237,246,276,286,300,303,323,330,341,353,

%U 361,377,390,392,412,415,426,431,459,485,493,496,504,516,520,542,554

%N a(n) = minimal m such that Sum [ Prime[k],{k,1,m}] >= Prime[n]*Prime[m].

%Y Cf. A075703.

%K nonn,easy

%O 1,1

%A _Robert G. Wilson v_, Oct 04 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)