A173898 -id:A173898 - cp's OEIS frontend

A000668 Mersenne primes (primes of the form 2^n - 1).

3, 7, 31, 127, 8191, 131071, 524287, 2147483647, 2305843009213693951, 618970019642690137449562111, 162259276829213363391578010288127, 170141183460469231731687303715884105727

Offset: 1

N. J. A. Sloane

For a Mersenne number 2^n - 1 to be prime, the exponent n must itself be prime.
See A000043 for the values of n.
Primes that are repunits in base 2.
Define f(k) = 2k+1; begin with k = 2, a(n+1) = least prime of the form f(f(f(...(a(n))))). - Amarnath Murthy, Dec 26 2003
Mersenne primes other than the first are of the form 6n+1. - Lekraj Beedassy, Aug 27 2004. Mersenne primes other than the first are of the form 24n+7; see also A124477. - Artur Jasinski, Nov 25 2007
A034876(a(n)) = 0 and A034876(a(n)+1) = 1. - Jonathan Sondow, Dec 19 2004
Mersenne primes are solutions to sigma(n+1)-sigma(n) = n as perfect numbers (A000396(n)) are solutions to sigma(n) = 2n. In fact, appears to give all n such that sigma(n+1)-sigma(n) = n. - Benoit Cloitre, Aug 27 2002
If n is in the sequence then sigma(sigma(n)) = 2n+1. Is it true that this sequence gives all numbers n such that sigma(sigma(n)) = 2n+1? - Farideh Firoozbakht, Aug 19 2005
It is easily proved that if n is a Mersenne prime then sigma(sigma(n)) - sigma(n) = n. Is it true that Mersenne primes are all the solutions of the equation sigma(sigma(x)) - sigma(x) = x? - Farideh Firoozbakht, Feb 12 2008
Sum of divisors of n-th even superperfect number A061652(n). Sum of divisors of n-th superperfect number A019279(n), if there are no odd superperfect numbers. - Omar E. Pol, Mar 11 2008
Indices of both triangular numbers and generalized hexagonal numbers (A000217) that are also even perfect numbers. - Omar E. Pol, May 10 2008, Sep 22 2013
Number of positive integers (1, 2, 3, ...) whose sum is the n-th perfect number A000396(n). - Omar E. Pol, May 10 2008
Vertex number where the n-th perfect number A000396(n) is located in the square spiral whose vertices are the positive triangular numbers A000217. - Omar E. Pol, May 10 2008
Mersenne numbers A000225 whose indices are the prime numbers A000043. - Omar E. Pol, Aug 31 2008
The digital roots are 1 if p == 1 (mod 6) and 4 if p == 5 (mod 6). [T. Koshy, Math Gaz. 89 (2005) p. 465]
Primes p such that for all primes q < p, p XOR q = p - q. - Brad Clardy, Oct 26 2011
All these primes, except 3, are Brazilian primes, so they are also in A085104 and A023195. - Bernard Schott, Dec 26 2012
All prime numbers p can be classified by k = (p mod 12) into four classes: k=1, 5, 7, 11. The Mersennne prime numbers 2^p-1, p > 2 are in the class k=7 with p=12*(n-1)+7, n=1,2,.... As all 2^p (p odd) are in class k=8 it follows that all 2^p-1, p > 2 are in class k=7. - Freimut Marschner, Jul 27 2013
From "The Guinness Book of Primes": "During the reign of Queen Elizabeth I, the largest known prime number was the number of grains of rice on the chessboard up to and including the nineteenth square: 524,287 [= 2^19 - 1]. By the time Lord Nelson was fighting the Battle of Trafalgar, the record for the largest prime had gone up to the thirty-first square of the chessboard: 2,147,483,647 [= 2^31 - 1]. This ten-digits number was proved to be prime in 1772 by the Swiss mathematician Leonard Euler, and it held the record until 1867." [du Sautoy] - Robert G. Wilson v, Nov 26 2013
If n is in the sequence then A024816(n) = antisigma(n) = antisigma(n+1) - 1. Is it true that this sequence gives all numbers n such that antisigma(n) = antisigma(n+1) - 1? Are there composite numbers with this property? - Jaroslav Krizek, Jan 24 2014
If n is in the sequence then phi(n) + sigma(sigma(n)) = 3n. Is it true that Mersenne primes are all the solutions of the equation phi(x) + sigma(sigma(x)) = 3x? - Farideh Firoozbakht, Sep 03 2014
a(5) = A229381(2) = 8191 is the "Simpsons' Mersenne prime". - Jonathan Sondow, Jan 02 2015
Equivalently, prime powers of the form 2^n - 1, see Theorem 2 in Lemos & Cambraia Junior. - Charles R Greathouse IV, Jul 07 2016
Primes whose sum of divisors is a power of 2. Primes p such that p + 1 is a power of 2. Primes in A046528. - Omar E. Pol, Jul 09 2016
From Jaroslav Krizek, Jan 19 2017: (Start)
Primes p such that sigma(p+1) = 2p+1.
Primes p such that A051027(p) = sigma(sigma(p)) = 2^k-1 for some k > 1.
Primes p of the form sigma(2^prime(n)-1)-1 for some n. Corresponding values of numbers n are in A016027.
Primes p of the form sigma(2^(n-1)) for some n > 1. Corresponding values of numbers n are in A000043 (Mersenne exponents).
Primes of the form sigma(2^(n+1)) for some n > 1. Corresponding values of numbers n are in A153798 (Mersenne exponents-2).
Primes p of the form sigma(n) where n is even; subsequence of A023195. Primes p of the form sigma(n) for some n. Conjecture: 31 is the only prime p such that p = sigma(x) = sigma(y) for distinct numbers x and y; 31 = sigma(16) = sigma(25).
Conjecture: numbers n such that n = sigma(sigma(n+1)-n-1)-1, i.e., A072868(n)-1.
Conjecture: primes of the form sigma(4*(n-1)) for some n. Corresponding values of numbers n are in A281312. (End)
[Conjecture] For n > 2, the Mersenne number M(n) = 2^n - 1 is a prime if and only if 3^M(n-1) == -1 (mod M(n)). - Thomas Ordowski, Aug 12 2018 [This needs proof! - Joerg Arndt, Mar 31 2019]
Named "Mersenne's numbers" by W. W. Rouse Ball (1892, 1912) after Marin Mersenne (1588-1648). - Amiram Eldar, Feb 20 2021
Theorem. Let b = 2^p - 1 (where p is a prime). Then b is a Mersenne prime iff (c = 2^p - 2 is totient or a term of A002202). Otherwise, if c is (nontotient or a term of A005277) then b is composite. Proof. Trivial, since, while b = v^g - 1 where v is even, v > 2, g is an integer, g > 1, b is always composite, and c = v^g - 2 is nontotient (or a term of A005277), and so is for any composite b = 2^g - 1 (in the last case, c = v^g - 2 is also nontotient, or a term of A005277). - Sergey Pavlov, Aug 30 2021 [Disclaimer: This proof has not been checked. - N. J. A. Sloane, Oct 01 2021]

Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 4.
John Brillhart, D. H. Lehmer, J. L. Selfridge, Bryant Tuckerman and S. S. Wagstaff, Jr., Factorizations of b^n +- 1. Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 2nd edition, 1985; and later supplements.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See pp. 135-136.
Graham Everest, Alf van der Poorten, Igor Shparlinski and Thomas Ward, Recurrence Sequences, Amer. Math. Soc., 2003; see esp. p. 255.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 76.
Marcus P. F. du Sautoy, The Number Mysteries, A Mathematical Odyssey Through Everyday Life, Palgrave Macmillan, First published in 2010 by the Fourth Estate, an imprint of Harper Collins UK, 2011, p. 46. - Robert G. Wilson v, Nov 26 2013
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Bryant Tuckerman, The 24th Mersenne prime, Notices Amer. Math. Soc., 18 (Jun, 1971), Abstract 684-A15, p. 608.

Harry J. Smith, Table of n, a(n) for n = 1..18
Peter Alfeld, The 39th Mersenne prime, 2003.
Yan Bingze, Li Qiong, Mao Haokun, and Chen Nan, An efficient hybrid hash based privacy amplification algorithm for quantum key distribution, arXiv:2105.13678 [quant-ph], 2021.
Andrew R. Booker, The Nth Prime Page
John Rafael M. Antalan, A Recreational Application of Two Integer Sequences and the Generalized Repetitious Number Puzzle, arXiv:1908.06014 [math.HO], 2019-2020.
W. W. Rouse Ball, Mathematical recreations and problems of past and present times, London, Macmillan and Co., 1892, pp. 24-25.
W. W. Rouse Ball, Mersenne's numbers, Messenger of Mathematics, Vol. 21 (1892), pp. 34-40, 121.
W. W. Rouse Ball, Mersenne's numbers, Nature, Vol. 89 (1912), p. 86.
John Brillhart, D. H. Lehmer, J. L. Selfridge, Bryant Tuckerman and S. S. Wagstaff, Jr., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
Kevin A. Broughan and Qizhi Zhou, On the Ratio of the Sum of Divisors and Euler's Totient Function II, Journal of Integer Sequences, Vol. 17 (2014), Article 14.9.2.
Douglas Butler, Mersenne Primes.
C. K. Caldwell, Mersenne primes.
C. K. Caldwell, "Top Twenty" page, Mersenne Primes.
Luis H. Gallardo and Olivier Rahavandrainy, On (unitary) perfect polynomials over F_2 with only Mersenne primes as odd divisors, arXiv:1908.00106 [math.NT], 2019.
Richard K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712. [Annotated scanned copy]
Christian Kassel and Christophe Reutenauer, Pairs of intertwined integer sequences, arXiv:2507.15780 [math.NT], 2025. See p. 12.
Sameen Ahmed Khan, Primes in Geometric-Arithmetic Progression, arXiv preprint arXiv:1203.2083 [math.NT], 2012. - From _N. J. A. Sloane_, Sep 15 2012
Abílio Lemos and Ady Cambraia Junior, On the number of prime factors of Mersenne numbers, arXiv:1606.08690 [math.NT] (2016).
Benny Lim, Prime Numbers Generated From Highly Composite Numbers, Parabola (2018) Vol. 54, Issue 3.
Math Reference Project, Mersenne and Fermat Primes.
Romeo Meštrović, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv preprint arXiv:1202.3670 [math.HO], 2012. - From _N. J. A. Sloane_, Jun 13 2012
Romeo Meštrović, Goldbach-type conjectures arising from some arithmetic progressions, University of Montenegro, 2018.
Romeo Meštrović, Goldbach's like conjectures arising from arithmetic progressions whose first two terms are primes, arXiv:1901.07882 [math.NT], 2019.
Landon Curt Noll, Mersenne Prime Digits and Names.
Passawan Noppakaew and Prapanpong Pongsriiam, Product of Some Polynomials and Arithmetic Functions, J. Int. Seq. (2023) Vol. 26, Art. 23.9.1.
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.
Primefan, The Mersenne Primes.
Christian Salas, Cantor Primes as Prime-Valued Cyclotomic Polynomials, arXiv preprint arXiv:1203.3969 [math.NT], 2012.
Harry J. Smith, Mersenne Primes, 1981-2010.
Gordon Spence, 36th Mersenne Prime Found, 1999.
Susan Stepney, Mersenne Prime.
Thesaurus.maths.org, Mersenne Prime.
Bryant Tuckerman, The 24th Mersenne prime, Proc. Nat. Acad. Sci. USA, Vol. 68 (1971), pp. 2319-2320.
Samuel S. Wagstaff, Jr., The Cunningham Project.
Yunlan Wei, Yanpeng Zheng, Zhaolin Jiang and Sugoog Shon, A Study of Determinants and Inverses for Periodic Tridiagonal Toeplitz Matrices with Perturbed Corners Involving Mersenne Numbers, Mathematics, Vol. 7, No. 10 (2019), 893.
Eric Weisstein's World of Mathematics, Mersenne Prime.
Eric Weisstein's World of Mathematics, Perfect Number.
Wikipedia, Mersenne prime.
Marek Wolf, Computer experiments with Mersenne primes, arXiv preprint arXiv:1112.2412 [math.NT], 2011.
Chai Wah Wu, Can machine learning identify interesting mathematics? An exploration using empirically observed laws, arXiv:1805.07431 [cs.LG], 2018.

Cf. A000225 (Mersenne numbers).
Cf. A000043 (Mersenne exponents).
Cf. A001348 (Mersenne numbers with n prime).
Cf. A000040, A000203, A000217, A000396, A003056, A007947, A016027, A019279, A023195, A023758, A028335 (lengths), A034876, A046051, A057951-A057958, A059305, A061652, A083420, A085104, A124477, A135659, A173898.

A000668:=Filtered(List(Filtered([1..600], IsPrime),i->2^i-1),IsPrime); # Muniru A Asiru, Oct 01 2017

A000668 := proc(n) local i;
i := 2^(ithprime(n))-1:
if (isprime(i)) then
   return i
fi: end:
seq(A000668(n), n=1..31); # Jani Melik, Feb 09 2011
# Alternate:
seq(numtheory:-mersenne([i]),i=1..26); # Robert Israel, Jul 13 2014

2^Array[MersennePrimeExponent, 18] - 1 (* Jean-François Alcover, Feb 17 2018, Mersenne primes with less than 1000 digits *)
2^MersennePrimeExponent[Range[18]] - 1 (* Eric W. Weisstein, Sep 04 2021 *)

forprime(p=2,1e5,if(ispseudoprime(2^p-1),print1(2^p-1", "))) \\ Charles R Greathouse IV, Jul 15 2011

LL(e) = my(n, h); n = 2^e-1; h = Mod(2, n); for (k=1, e-2, h=2*h*h-1); return(0==h) \\ after Joerg Arndt in A000043
forprime(p=1, , if(LL(p), print1(p, ", "))) \\ Felix Fröhlich, Feb 17 2018

from sympy import isprime, primerange
print([2**n-1 for n in primerange(1, 1001) if isprime(2**n-1)]) # Karl V. Keller, Jr., Jul 16 2020

a(n) = sigma(A061652(n)) = A000203(A061652(n)). - Omar E. Pol, Apr 15 2008
a(n) = sigma(A019279(n)) = A000203(A019279(n)), provided that there are no odd superperfect numbers. - Omar E. Pol, May 10 2008
a(n) = A000225(A000043(n)). - Omar E. Pol, Aug 31 2008
a(n) = 2^A000043(n) - 1 = 2^(A000005(A061652(n))) - 1. - Omar E. Pol, Oct 27 2011
a(n) = A000040(A059305(n)) = A001348(A016027(n)). - Omar E. Pol, Jun 29 2012
a(n) = A007947(A000396(n))/2, provided that there are no odd perfect numbers. - Omar E. Pol, Feb 01 2013
a(n) = 4*A134709(n) + 3. - Ivan N. Ianakiev, Sep 07 2013
a(n) = A003056(A000396(n)), provided that there are no odd perfect numbers. - Omar E. Pol, Dec 19 2016
Sum_{n>=1} 1/a(n) = A173898. - Amiram Eldar, Feb 20 2021

A335431 Numbers of the form q*(2^k), where q is one of the Mersenne primes (A000668) and k >= 0.

Original entry on oeis.org

3, 6, 7, 12, 14, 24, 28, 31, 48, 56, 62, 96, 112, 124, 127, 192, 224, 248, 254, 384, 448, 496, 508, 768, 896, 992, 1016, 1536, 1792, 1984, 2032, 3072, 3584, 3968, 4064, 6144, 7168, 7936, 8128, 8191, 12288, 14336, 15872, 16256, 16382, 24576, 28672, 31744, 32512, 32764, 49152, 57344, 63488, 65024, 65528, 98304, 114688, 126976, 130048, 131056, 131071

Offset: 1

Antti Karttunen, Jun 28 2020

nonn

Numbers of the form 2^k * ((2^p)-1), where p is one of the primes in A000043, and k >= 0.
Numbers k such that A000265(k) is in A000668.
Numbers k for which A331410(k) = 1.
Numbers k that themselves are not powers of two, but for which A335876(k) = k+A052126(k) is [a power of 2].
Conjecture: This sequence gives all fixed points of map n -> A332214(n) and its inverse n -> A332215(n). See also notes in A029747 and in A163511.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000043, A000396 (even terms form a subsequence), A000668 (primes present), A335882, A341622.
Row 1 of A335430.
Positions of 1's in A331410, in A364260, and in A364251 (characteristic function).
Subsequence of A054784.
Cf. also A029747, A163511, A173898, A332214, A332215, A334101, A335876.

qs = 2^MersennePrimeExponent[Range[6]] - 1; max = qs[[-1]]; Reap[Do[n = 2^k*q; If[n <= max, Sow[n]], {k, 0, Log2[max]}, {q, qs}]][[2, 1]] // Union (* Amiram Eldar, Feb 18 2021 *)

A000265(n) = (n>>valuation(n,2));
isA000668(n) = (isprime(n)&&!bitand(n,1+n));
isA335431(n) = isA000668(A000265(n));

A332214(a(n)) = A332215(a(n)) = a(n) for all n.

Sum_{n>=1} 1/a(n) = 2 * A173898 = 1.0329083578... - Amiram Eldar, Feb 18 2021

A147645 Number of distinct Mersenne primes dividing n.

Original entry on oeis.org

0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 2, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 1, 1, 0, 2, 0, 0, 1, 0, 1, 1, 0

Offset: 1

Omar E. Pol, Nov 09 2008

a(n) = m first occurs at n = A098918(m). - Robert Israel, Feb 03 2020

			a(21)=2 because 1, 3, 7 and 21 are divisors of 21. Then 21 has two divisors that are Mersenne primes (A000668): 3 and 7.

Antti Karttunen, Table of n, a(n) for n = 1..131072 (terms 1..10000 from Robert Israel)

Cf. A000265, A000668, A001221, A080225, A098918, A154402, A173898, A353786.

Coincides with A331410 on A054784.

N:= 100: # for a(1)..a(N)
V:= Vector(N):
for i from 1 do
m:= numtheory:-mersenne([i]);
if m > N then break fi;
for j from m by m to N do
    V[j]:= V[j]+1
od od:
convert(V,list); # Robert Israel, Feb 03 2020

A147645(n) = { my(m=3,s=0); while(m<=n, s += (isprime(m)*!(n%m)); m += (m+1)); (s); }; \\ Antti Karttunen, May 12 2022

From Antti Karttunen, May 12 2022: (Start)
a(n) = A154402(n) - A353786(n)
a(n) = a(2*n) = a(A000265(n)).
a(n) <= A331410(n). (End)
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = A173898 = 0.516454... . - Amiram Eldar, Dec 31 2023

A209601 Continued fraction expansion of the sum of the reciprocals of the Mersenne primes (A000668).

Original entry on oeis.org

1, 1, 14, 1, 2, 3, 1, 3, 2, 5, 194, 1, 14, 1, 2, 2, 2, 40, 1, 1, 1, 4, 4, 1, 5, 1, 4, 4, 1, 3, 18, 1, 1, 7, 28, 2, 5, 1, 4, 13, 3, 2, 2, 3, 9, 2, 3, 6, 1, 3, 3, 3, 3, 1, 1, 3, 8, 1, 184, 3, 2, 1, 1, 1, 3, 1, 1, 12, 1, 10, 2, 3, 2, 6, 18, 1, 1, 9

Offset: 1

N. J. A. Sloane, Mar 10 2012

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A000668, A173898, A209600.

ContinuedFraction[Total[1/(2^MersennePrimeExponent[Range[30]]-1)],80] (* Harvey P. Dale, Aug 09 2021 *)

isM(p)=my(m=Mod(4,2^p-1));for(i=1,p-2,m=m^2-2);!m
s=1/3;forprime(p=3,default(realprecision)*log(10)\log(2), if(isM(p), s+=1./(2^p-1)));v=contfrac(s);vector(#v-2,i,v[i+1]) \\ Charles R Greathouse IV, Mar 22 2012

A306204 Decimal expansion of Product_{p>=3} (1+1/p) over the Mersenne primes.

Original entry on oeis.org

1, 5, 8, 5, 5, 5, 8, 8, 8, 7, 9, 2, 5, 6, 3, 8, 7, 7, 6, 9, 7, 8, 6, 3, 7, 0, 2, 3, 2, 1, 9, 2, 3, 8, 4, 7, 6, 0, 6, 9, 4, 0, 5, 8, 6, 7, 9, 4, 7, 0, 2, 8, 1, 1, 3, 2, 9, 8, 1, 2, 6, 7, 8, 9, 2, 8, 8, 5, 9, 7, 5, 4, 5, 7, 6, 7, 8, 5, 5, 6, 9, 0, 5, 3, 5, 0, 0, 7, 9, 1, 1, 7, 9, 9, 3, 5, 6, 1, 9, 5

Offset: 1

Tomohiro Yamada, Jan 29 2019

This is equal to Product_{q>=1} (1-1/2^q)^(-1) over all q with 2^q - 1 a Mersenne prime.

			Decimal expansion of (4/3) * (8/7) * (32/31) * (128/127) * (8192/8191) * (131072/131071) * (524288/524287) * ... = 1.585558887...

Tomohiro Yamada, Table of n, a(n) for n = 1..99
Tomohiro Yamada, Unitary super perfect numbers, Mathematica Pannonica, Volume 19, No. 1, 2008, pp. 37-47, using this constant with only a rough upper bound (4/3)*exp(4/21) < 1.6131008.

Cf. A065446 (the corresponding product over all Mersenne numbers, prime or composite).
Cf. A173898 (the sum of reciprocals of the Mersenne primes).
Cf. A065442 (the sum of reciprocals of the Mersenne numbers, prime or composite).
Cf. A046528.

t=1.0;for(i=1,500,p=2^i-1;if(isprime(p),t=t*(p+1)/p))

Equals Sum_{n>=1} 1/A046528(n). - Amiram Eldar, Jan 06 2021

A335118 Decimal expansion of the sum of the reciprocals of the perfect numbers.

Original entry on oeis.org

2, 0, 4, 5, 2, 0, 1, 4, 2, 8, 3, 8, 9, 2, 6, 4, 3, 0, 1, 7, 8, 1, 3, 4, 4, 2, 9, 0, 9, 8, 4, 5, 5, 5, 7, 6, 6, 7, 7, 3, 1, 1, 4, 8, 9, 3, 5, 0, 7, 6, 3, 3, 9, 7, 0, 0, 6, 4, 2, 4, 8, 2, 4, 8, 9, 8, 6, 2, 2, 7, 4, 4, 0, 4, 5, 1, 3, 1, 9, 8, 5, 4, 0, 7, 0, 7, 6

Offset: 0

Amiram Eldar, May 24 2020

Bayless and Klyve (2013) calculated the first 149 terms of this sequence. The terms beyond this are uncertain due to the possible existence of odd perfect numbers larger than 10^300.

			0.20452014283892643017813442909845557667731148935076...

Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 244.

Jonathan Bayless and Dominic Klyve, Reciprocal sums as a knowledge metric: theory, computation, and perfect numbers, The American Mathematical Monthly, Vol. 120, No. 9 (2013), pp. 822-831, alternative link, preprint.

Cf. A000396, A173898.

RealDigits[Sum[1/2^(p - 1)/(2^p - 1), {p, MersennePrimeExponent[Range[14]]}], 10, 100][[1]]
RealDigits[Total[1/PerfectNumber[Range[15]]],10,120][[1]] (* Harvey P. Dale, Nov 25 2023 *)

Equals Sum_{k>=1} 1/A000396(k).

A353786 Number of distinct nonprime numbers of the form 2^k - 1 that divide n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2

Offset: 1

Antti Karttunen, May 12 2022

nonn

			Divisors of 255 are [1, 3, 5, 15, 17, 51, 85, 255], of these of the form 2^k - 1 (A000225) are 1, 3, 15 and 255, but only three of them are counted (because 3 is a prime), therefore a(255) = 3.

Antti Karttunen, Table of n, a(n) for n = 1..100000

Cf. A000225, A000265, A147645, A154402.

Cf. A065442, A135972, A173898.

a[n_] := DivisorSum[n, 1 &, !PrimeQ[#] && # + 1 == 2^IntegerExponent[# + 1, 2] &]; Array[a, 120] (* Amiram Eldar, May 12 2022 *)

A353786(n) = { my(m=1,s=0); while(m<=n, s += (!isprime(m))*!(n%m); m += (m+1)); (s); };

a(n) = A154402(n) - A147645(n).
a(n) = a(2*n) = a(A000265(n)).
For all primes p, a(p) = 1.
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{n>=2} 1/A135972(n) = A065442 - A173898 = 1.0902409734... . - Amiram Eldar, Dec 31 2023

A209600 Analog of A048613 based on sum of reciprocals of Mersenne primes.

Original entry on oeis.org

1, 3, 2, 16, 17, 21, 24, 26, 29, 412, 788, 1045, 369625, 369636

Offset: 1

N. J. A. Sloane, Mar 10 2012

M. Wolf, Computer experiments with Mersenne primes, arXiv preprint arXiv:1112.2412, 2011

Cf. A048613, A173898, A000668, A209601.

A173995 Continued fraction expansion of sum of reciprocals of Fermat primes.

Original entry on oeis.org

0, 1, 1, 2, 9, 1, 3, 5, 1, 2, 1, 1, 1, 1, 3, 1, 7, 1, 31, 1, 2, 4, 5

Offset: 1

Jonathan Vos Post, Mar 04 2010

If there are only five Fermat primes, a(24) = 2 is the last term of this sequence. Otherwise, a(24) = a(25) = 1 and a(26) is large (billions of digits).

This sequence is finite if and only if A019434 is finite.

			(1/3) + (1/5) + (1/17) + (1/257) + (1/65537) = 2560071829/4294967295 = 0 + 1/1+ 1/1+ 1/2+ 1/9+ 1/1+ 1/3+ 1/5+ 1/1+ 1/2+ 1/1+ 1/1+ 1/1+ 1/1+ 1/3+ 1/1+ 1/7+ 1/1+ 1/31+ 1/1+ 1/2+ 1/4+ 1/5+ 1/2.

S. W. Golomb, Irrationality of the sum of reciprocals of fermat numbers and other functions, NASA Technical Report 19630013175, Accession ID 63N23055, Contract/grant NAS7-100, 4 pp., Jet Propulsion Laboratory, Jan 01 1962.

Cf. A019434, A000215, A159611, A173898 (sum of reciprocals of Mersenne primes), A007400.

(* Assuming 65537 is the largest Fermat prime *) ContinuedFraction[Sum[1/(2^(2^n) + 1), {n, 0, 4}]] (* Alonso del Arte, Apr 21 2013 *)

Continued fraction of Sum_{i >= 1} 1/A019434(i).

Sequence corrected and comments added by Charles R Greathouse IV, Feb 04 2011

A306759 Decimal expansion of the sum of reciprocals of Brazilian primes, also called the Brazilian primes constant.

Original entry on oeis.org

3, 3, 1, 7, 5, 4, 4, 6, 6

Offset: 0

Bernard Schott, Mar 08 2019

The name "constant of Brazilian primes" is used in the article "Les nombres brésiliens" in link, théorème 4, page 36. Brazilian primes are in A085104.
Let S(k) be the sum of reciprocals of Brazilian primes < k. These values below come from different calculations by Jon, Michel, Daniel and Davis.
   q            S(10^q)
  ==    ========================
  0.1428571428571428571...  (= 1/7)
  0.2889927283868234859...
  0.3229022355626914481...
  0.3295236806353669357...
  0.3312171311946179843...
  0.3316038696349217289...
  0.3317139158654747333...
  0.3317434191078170412...
  0.3317513267394988538...
  0.3317535651668937256...
  0.3317542057931842329...
  0.3317543906772274268...
  0.3317544444033188051...
  0.3317544601136967527...
  0.3317544647354485208...
  0.3317544661014868080...
  0.3317544665073451951...
  0.3317544666282877863...
  0.3317544666644601817...
  0.3317544666753095766...
According to the Goormaghtigh conjecture, there are only two Brazilian primes which are twice Brazilian: 31 = (111)_5 = (11111)_2 and 8191 = (111)_90 = (1111111111111)_2. The reciprocals of these two numbers are counted only once in the sum.

			1/7 + 1/13 + 1/31 + 1/43 + 1/73 + 1/127 + 1/157 + ... = 0.33175...

Daniel Lignon, Dictionnaire de (presque) tous les nombres entiers, Ellipses, Paris, 2012, page 175.

Bernard Schott, Les nombres brésiliens, Quadrature, no. 76, avril-juin 2010, pages 30-38; included here with permission from the editors of Quadrature.
Wikipedia, Goormaghtigh conjecture.

Cf. A085104 (Brazilian primes), A002383 (Brazilian primes (111)_b), A225148 (Brazilian primes of the form (b^q-1)/(b-1) with q prime >= 5).

Cf. A173898 (sum of the reciprocals of the Mersenne primes), A065421 (Brun's constant).

brazil(N, L=List())=forprime(K=3, #binary(N+1)-1, for(n=2, sqrtnint(N-1, K-1), if(isprime((n^K-1)/(n-1)),listput(L, (n^K-1)/(n-1))))); Set(L);
brazilcons(lim,nbd) = r=brazil(10^lim); x=sum(M=1, #r, 1./r[M]);for(n=1, nbd, print1(floor(x*10^n)%10, ", "));\\ Davis Smith, Mar 10 2019

cons(lim)=my(v=List(), t, k); for(n=2, sqrt(lim), t=1+n; k=1; while((t+=n^k++)<=lim, if(isprime(t), listput(v, t)))); v = vecsort(Vec(v), , 8); sum(k=1, #v, 1./v[k]); \\ Michel Marcus, Mar 11 2019

Equals Sum_{n>=1} 1/A085104(n).

cp's OEIS Frontend

A000668 Mersenne primes (primes of the form 2^n - 1).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Maple

Mathematica

PARI

PARI

Python

Formula

A335431 Numbers of the form q*(2^k), where q is one of the Mersenne primes (A000668) and k >= 0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A147645 Number of distinct Mersenne primes dividing n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

PARI

Formula

A209601 Continued fraction expansion of the sum of the reciprocals of the Mersenne primes (A000668).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

A306204 Decimal expansion of Product_{p>=3} (1+1/p) over the Mersenne primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A335118 Decimal expansion of the sum of the reciprocals of the perfect numbers.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

A353786 Number of distinct nonprime numbers of the form 2^k - 1 that divide n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs