The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A072920 a(n) = Sum_{k=1..n} A034693(k). 1

%I #14 May 05 2022 10:07:13

%S 1,2,4,5,7,8,12,14,16,17,19,20,24,26,28,29,35,36,46,48,50,51,53,56,60,

%T 62,66,67,69,70,80,83,85,88,90,91,95,100,102,103,105,106,110,112,116,

%U 117,123,125,129,131,133,134,136,138,144,146,150,151,163,164,170,175

%N a(n) = Sum_{k=1..n} A034693(k).

%H Amiram Eldar, <a href="/A072920/b072920.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) appears to be asymptotic to (zeta(2)-1)*n*log(n) where zeta(2)-1 = Pi^2/6-1 = 0.6449... . Example: a(10^5)/10^5/log(10^5) = 0.6449(1)... .

%t f[n_] := Module[{k = 1}, While[!PrimeQ[k*n + 1], k++]; k]; Accumulate[Table[f[n], {n, 1, 100}]] (* _Amiram Eldar_, May 05 2022 *)

%o (PARI) f(n) = if(n<0, 0, s=1; while(isprime(s*n+1)==0, s++); s); \\ A034693

%o a(n) = sum(k=1, n, f(k)); \\ _Michel Marcus_, May 05 2022

%Y Cf. A013661, A034693.

%K nonn

%O 1,2

%A _Benoit Cloitre_, Aug 11 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 May 22 18:14 EDT 2024. Contains 372758 sequences. (Running on oeis4.)