%I A007013 M0866
%S A007013 2,3,7,127,170141183460469231731687303715884105727
%N A007013 a(0) = 2; for n >= 0, a(n+1) = 2^a(n) - 1.
%C A007013 Orbit of 2 under iteration of the "Mersenne operator" M: n -> 2^n-1 (0
and 1 are fixed points of M). - M. F. Hasler (Maximilian.Hasler(AT)gmail.com),
Nov 15 2006
%C A007013 Called also the Catalan sequence - Artur Jasinski (grafix(AT)csl.pl),
Nov 25 2007
%D A007013 P. Ribenboim, The Book of Prime Number Records. Springer-Verlag, NY,
2nd ed., 1989, p. 81.
%D A007013 W. Sierpi\'{n}ski, A Selection of Problems in the Theory of Numbers.
Macmillan, NY, 1964, p. 91.
%D A007013 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
%H A007013 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
Catalan-MersenneNumber.html">Catalan-Mersenne Number</a>
%H A007013 Will Edgington, <a href="http://www.garlic.com/~wedgingt/MMPstats.txt">
Status of M(M(p)) where M(p) is a Mersenne prime</a>.
%H A007013 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
DoubleMersenneNumber.html">Double Mersenne Number</a>.
%H A007013 Chris K. Caldwell, <a href="http://primes.utm.edu/mersenne/index.html#c">
Mersenne Primes</a>.
%F A007013 a(n) = M(a(n-1)) = M^n(2) with M: n-> 2^n-1 - M. F. Hasler (Maximilian.Hasler(AT)gmail.com),
Nov 15 2006
%p A007013 M:=n->2^n-1; '(M@@i)(2)'$i=0..4; - M. F. Hasler (Maximilian.Hasler(AT)gmail.com),
Nov 15 2006
%Y A007013 Cf. A014221.
%Y A007013 Sequence in context: A062935 A083436 A088856 this_sequence A103405 A087311
A053924
%Y A007013 Adjacent sequences: A007010 A007011 A007012 this_sequence A007014 A007015
A007016
%K A007013 nonn
%O A007013 0,1
%A A007013 N. J. A. Sloane (njas(AT)research.att.com), Nik Lygeros (webmaster(AT)lygeros.org)
%E A007013 The next term is too large to include.
%E A007013 Edited by Henry Bottomley (se16(AT)btinternet.com), Nov 07 2002
|