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!)
A330718 a(n) = numerator(Sum_{k=1..n} (2^k-2)/k). 6

%I #53 Sep 08 2022 08:46:24

%S 0,1,3,13,25,137,245,871,517,4629,8349,45517,83317,1074679,1992127,

%T 7424789,13901189,78403447,147940327,280060651,531718651,11133725681,

%U 21243819521,40621501691,15565330735,388375065019,248882304985,479199924517,923951191477,2973006070891

%N a(n) = numerator(Sum_{k=1..n} (2^k-2)/k).

%C If p > 3 is prime, then p^2 | a(p).

%C Note the similarity to Wolstenholme's theorem.

%C Conjecture: for n > 3, if n^2 | a(n), then n is prime.

%C Are there the weak pseudoprimes m such that m | a(m)?

%C Primes p such that p^3 | a(p) are probably A088164.

%C If p is an odd prime, then a(p+1) == A330719(p+1) (mod p).

%C If p > 3 is a prime, then p^2 | numerator(Sum_{k=1..p+1} F(k)), where F(n) = Sum_{k=1..n} (2^(k-1)-1)/k. Cf. A027612 (a weaker divisibility).

%H G. C. Greubel, <a href="/A330718/b330718.txt">Table of n, a(n) for n = 1..1000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WolstenholmesTheorem.html">Wolstenholme's Theorem</a>

%F a(n) = numerator(Sum_{k=1..n} (2^(k-1)-1)/k).

%F a(n+1) = numerator(a(n)/A330719(n) + A225101(n+1)/(2*A159353(n+1))).

%F a(p) = a(p-1) + A007663(n)*A330719(p-1) for p = prime(n) > 2.

%F a(n) = numerator(-(2^(n+1)*LerchPhi(2,1,n+1) + Pi*i + 2*HarmonicNumber(n))). - _G. C. Greubel_, Dec 28 2019

%F a(n) = numerator(A279683(n)/n!) for n > 0. - _Amiram Eldar_ and _Thomas Ordowski_, Jan 15 2020

%p seq(numer(add((2^k -2)/k, k = 1..n)), n = 1..30); # _G. C. Greubel_, Dec 28 2019

%t Numerator @ Accumulate @ Array[(2^# - 2)/# &, 30]

%t Table[Numerator[Simplify[-(2^(n+1)*LerchPhi[2,1,n+1] +Pi*I +2*HarmonicNumber[n])]], {n,30}] (* _G. C. Greubel_, Dec 28 2019 *)

%o (PARI) a(n) = numerator(sum(k=1, n, (2^k-2)/k)); \\ _Michel Marcus_, Dec 28 2019

%o (Magma) [Numerator( &+[(2^k -2)/k: k in [1..n]] ): n in [1..30]]; // _G. C. Greubel_, Dec 28 2019

%o (Sage) [numerator( sum((2^k -2)/k for k in (1..n)) ) for n in (1..30)] # _G. C. Greubel_, Dec 28 2019

%Y Cf. A001008, A007663, A088164, A159353, A225101, A279683, A330719.

%K nonn,frac

%O 1,3

%A _Amiram Eldar_ and _Thomas Ordowski_, Dec 28 2019

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 August 14 15:26 EDT 2024. Contains 375165 sequences. (Running on oeis4.)