cp's OEIS Frontend

A051179 a(n) = 2^(2^n) - 1.

%I A051179 #117 Mar 20 2025 13:58:46
%S A051179 1,3,15,255,65535,4294967295,18446744073709551615,
%T A051179 340282366920938463463374607431768211455,
%U A051179 115792089237316195423570985008687907853269984665640564039457584007913129639935
%N A051179 a(n) = 2^(2^n) - 1.
%C A051179 In a tree with binary nodes (0, 1 children only), the maximum number of unique child nodes at level n.
%C A051179 Number of binary trees (each vertex has 0, or 1 left, or 1 right, or 2 children) such that all leaves are at level n. Example: a(1) = 3 because we have (i) root with a left child, (ii) root with a right child and (iii) root with two children. a(n) = A000215(n) - 2. - _Emeric Deutsch_, Jan 20 2004
%C A051179 Similarly, this is also the number of full balanced binary trees of height n. (There is an obvious 1-to-1 correspondence between the two sets of trees.) - David Hobby (hobbyd(AT)newpaltz.edu), May 02 2010
%C A051179 Partial products of A000215.
%C A051179 The first 5 terms n (only) have the property that phi(n)=(n+1)/2, where phi(n) = A000010(n) is Euler's totient function. - _Lekraj Beedassy_, Feb 12 2007
%C A051179 If A003558(n) is of the form 2^n and A179480(n+1) is even, then (2^(A003558(n)) - 1) is in A051179. Example: A003558(25) = 8 with A179480(25) = 4, even. Then (2^8 - 1) = 255. - _Gary W. Adamson_, Aug 20 2012
%C A051179 For any odd positive a(0), the sequence defined by a(n) = a(n-1) * (a(n-1) + 2) gives a constructive proof that there exist integers with at least n distinct prime factors, e.g., a(n), since omega(a(n)) >= n. As a corollary, this gives a constructive proof of Euclid's theorem stating that there are infinitely many primes. - _Daniel Forgues_, Mar 07 2017
%C A051179 From _Sergey Pavlov_, Apr 24 2017: (Start)
%C A051179 I conjecture that, for n > 7, omega(a(n)) > omega(a(n-1)) > n.
%C A051179 It seems that the largest prime divisor p(n+1) of a(n+1) is always bigger than the largest prime divisor of a(n): p(n+1) > p(n). For 3 < n < 8, p(n+1) > 100 * p(n).
%C A051179 (End)
%C A051179 It appears that a(n) is the integer whose bits indicate the possible subset sums of the first n powers of two. For another example, see the calculation for primes at A368491 - _Yigit Oktar_, Mar 20 2025
%D A051179 M. Aigner and G. M. Ziegler, Proofs from The Book, Springer-Verlag, Berlin, 1999; see p. 4.
%H A051179 Vincenzo Librandi, <a href="/A051179/b051179.txt">Table of n, a(n) for n = 0..11</a>
%H A051179 A. V. Aho and N. J. A. Sloane, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/11-4/aho-a.pdf">Some doubly exponential sequences</a>, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437.
%H A051179 A. V. Aho and N. J. A. Sloane, <a href="/A000058/a000058.pdf">Some doubly exponential sequences</a>, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437 (original plus references that F.Q. forgot to include - see last page!)
%H A051179 J. H. Conway, <a href="https://doi.org/10.1016/0012-365X(90)90008-6">Integral lexicographic codes</a>, Discrete Mathematics 83.2-3 (1990): 219-235. See p. 235.
%H A051179 Ben Delo and Filip Saidak, <a href="https://www.fq.math.ca/Papers/57-4/saidak07132019.pdf">Euclid's theorem redux</a>, Fib. Q., 57:4 (2019), 331-336.
%H A051179 <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>.
%F A051179 a(n) = A000215(n) - 2.
%F A051179 a(n) = (a(n-1) + 1)^2 - 1, a(0) = 1. [ or a(n) = a(n-1)(a(n-1) + 2) ].
%F A051179 1 = 2/3 + 4/15 + 16/255 + 256/65535 + ... = Sum_{n>=0} A001146(n)/a(n+1) with partial sums: 2/3, 14/15, 254/255, 65534/65535, ... - _Gary W. Adamson_, Jun 15 2003
%F A051179 a(n) = b(n-1) where b(1)=1, b(n) = Product_{k=1..n-1} (b(k) + 2). - _Benoit Cloitre_, Sep 13 2003
%F A051179 A136308(n) = A007088(a(n)). - _Jason Kimberley_, Dec 19 2012
%F A051179 A000215(n) = a(n+1) / a(n). - _Daniel Forgues_, Mar 07 2017
%F A051179 Sum_{n>=0} 1/a(n) = A048649. - _Amiram Eldar_, Oct 27 2020
%e A051179 15 = 3*5; 255 = 3*5*17; 65535 = 3*5*17*257; ... - _Daniel Forgues_, Mar 07 2017
%p A051179 A051179:=n->2^(2^n)-1; seq(A051179(n), n=0..8); # _Wesley Ivan Hurt_, Feb 08 2014
%t A051179 Table[2^(2^n)-1,{n,0,9}] (* _Vladimir Joseph Stephan Orlovsky_, Mar 16 2010 *)
%o A051179 (PARI) a(n)=if(n<0,0,2^2^n-1)
%o A051179 (Magma) [2^(2^n)-1: n in [0..8]]; // _Vincenzo Librandi_, Jun 20 2011
%o A051179 (Python)
%o A051179 def A051179(n): return (1<<(1<<n))-1 # _Chai Wah Wu_, May 03 2023
%Y A051179 Cf. A001146, A007018, A048649.
%Y A051179 Cf. A003558, A179480, A000215.
%Y A051179 Cf. A368491
%K A051179 nonn,easy,nice
%O A051179 0,2
%A A051179 Alan DeKok (aland(AT)ox.org)