A125708
Numbers k such that A115963(k) is prime.
Original entry on oeis.org
3, 5, 9, 43, 150, 300, 516, 1254
Offset: 1
-
f=0;Do[p=Prime[n];f=f+1/p^3;g=Numerator[f];If[PrimeQ[g],Print[{n,p,g}]],{n,1,50}]
A024451
a(n) is the numerator of Sum_{i = 1..n} 1/prime(i).
Original entry on oeis.org
0, 1, 5, 31, 247, 2927, 40361, 716167, 14117683, 334406399, 9920878441, 314016924901, 11819186711467, 492007393304957, 21460568175640361, 1021729465586766997, 54766551458687142251, 3263815694539731437539, 201015517717077830328949, 13585328068403621603022853
Offset: 0
0/1, 1/2, 5/6, 31/30, 247/210, 2927/2310, 40361/30030, 716167/510510, 14117683/9699690, ...
- S. R. Finch, Mathematical Constants, Cambridge, 2003, Sect. 2.2.
- D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Sect. VII.28.
Subsequence of
A048103 (after the initial 0).
Cf.
A369972 (k where prime(1+k)|a(k)),
A369973 (corresponding primorials),
A293457 (corresponding primes),
A377992 (antiderivatives of the terms > 1 of this sequence).
-
[ Numerator(&+[ NthPrime(k)^-1: k in [1..n]]): n in [1..18] ]; // Bruno Berselli, Apr 11 2011
-
h:= n-> add(1/(ithprime(i)),i=1..n);
t1:=[seq(h(n),n=0..50)];
t1a:=map(numer,t1); # A024451
t1b:=map(denom,t1); # A002110 - N. J. A. Sloane, Apr 25 2014
-
a[n_] := Numerator @ Sum[1/Prime[i], {i, n}]; Array[a,18] (* Jean-François Alcover, Apr 11 2011 *)
f[k_] := Prime[k]; t[n_] := Table[f[k], {k, 1, n}]
a[n_] := SymmetricPolynomial[n - 1, t[n]]
Table[a[n], {n, 1, 16}] (* A024451 *)
(* Clark Kimberling, Dec 29 2011 *)
Numerator[Accumulate[1/Prime[Range[20]]]] (* Harvey P. Dale, Apr 11 2012 *)
-
a(n) = numerator(sum(i=1, n, 1/prime(i))); \\ Michel Marcus, Sep 18 2018
-
from sympy import prime
from fractions import Fraction
def a(n): return sum(Fraction(1, prime(k)) for k in range(1, n+1)).numerator
print([a(n) for n in range(20)]) # Michael S. Branicky, Feb 12 2021
-
from math import prod
from sympy import prime
def A024451(n):
q = prod(plist:=tuple(prime(i) for i in range(1,n+1)))
return sum(q//p for p in plist) # Chai Wah Wu, Nov 03 2022
A115964
Denominator of Sum_{i=1..n} 1/prime(i)^3.
Original entry on oeis.org
8, 216, 27000, 9261000, 12326391000, 27081081027000, 133049351085651000, 912585499096480209000, 11103427767506874702903000, 270801499821725167129101267000, 8067447481189014453943055845197000
Offset: 1
1/8, 35/216, 4591/27000, 1601713/9261000, 2141141003/12326391000, 4716413174591/27081081027000.
Cf.
A024451 (numerator of sum_{i=1..n} 1/prime(i)),
A002110 (primorial, also denominator of sum_{i=1..n} 1/prime(i)),
A061015 (numerator of sum_{i=1..n} 1/prime(i)^2).
A241189
Numerator of Sum_{i=1..n} 1/(prime(i)*prime(i+1)).
Original entry on oeis.org
1, 7, 11, 127, 1693, 29243, 561623, 13019431, 379503437, 11809225121, 438235268123, 18007758091069, 775817745542929, 36524284093223105, 1938403609207158571, 2160165866032831207, 131893095784520401909, 8844093116997411126541, 628373208972323386101329, 45900898298568589325230523
Offset: 1
1/6, 7/30, 11/42, 127/462, 1693/6006, 29243/102102, 561623/1939938, 13019431/44618574, 379503437/1293938646, 11809225121/40112098026, 438235268123/1484147626962, ...
-
g:= n-> add(1/(ithprime(i)*ithprime(i+1)),i=1..n);
t1:=[seq(g(n),n=1..20)];
t1a:=map(numer,t1); # A241189
t1b:=map(denom,t1); # A241190
-
Table[Numerator@ Sum[1/(Prime[i + 1] Prime@ i), {i, n}], {n, 20}] (* Michael De Vlieger, Jan 27 2016 *)
Accumulate[1/#&/@(Times@@@Partition[Prime[Range[25]],2,1])]//Numerator (* Harvey P. Dale, Mar 14 2023 *)
A126225
Least number k > 0 such that the numerator of Sum_{i=1..k} 1/prime(i)^n is a prime.
Original entry on oeis.org
2, 2, 3, 2, 3, 5, 3, 11, 3, 22
Offset: 1
a(1) = 2 corresponds to A024451(2) = 5, a prime.
a(2) = 2 corresponds to A061015(2) = 13, a prime.
-
a[n_] := Block[{i = 1, sum = 0}, While[True, sum += 1/Prime[i]^n; If[PrimeQ[Numerator@sum], Return[i]]; i++ ]] (* J. Mulder (jasper.mulder(AT)planet.nl), Jan 25 2010 *)
Table[y[x_,y_]:=Numerator[FullSimplify[Sum[1/Prime[m]^x,{m,1,y}]]];k=1;Monitor[Parallelize[While[True,If[PrimeQ[y[n,k]],Break[]];k++];k],k],{n,1,10}] (* J.W.L. (Jan) Eerland, Jan 25 2023 *)
-
a(n) = {my(k=1, s=1/prime(k)^n); while (! isprime(numerator(s)), k++; s += 1/prime(k)^n); k;} \\ Michel Marcus, May 27 2019
Showing 1-5 of 5 results.
Comments