|
%I M3611 #98 Dec 21 2023 11:16:29
%S 0,1,4,25,676,458329,210066388900,44127887745906175987801,
%T 1947270476915296449559703445493848930452791204,
%U 3791862310265926082868235028027893277370233152247388584761734150717768254410341175325352025
%N a(0) = 0; for n > 0, a(n) = (a(n-1) + 1)^2.
%C Take the standard rooted binary tree of depth n, with 2^(n+1) - 1 labeled nodes. Here is a picture of the tree of depth 3:
%C R
%C / \
%C / \
%C / \
%C / \
%C / \
%C o o
%C / \ / \
%C / \ / \
%C o o o o
%C / \ / \ / \ / \
%C o o o o o o o o
%C Let the number of rooted subtrees be s(n). For example, for n = 1 the s(2) = 4 subtrees are:
%C R R R R
%C / \ / \
%C o o o o
%C Then s(n+1) = 1 + 2*s(n) + s(n)^2 = (1+s(n))^2 and so s(n) = a(n+1).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D Mordechai Ben-Ari, Mathematical Logic for Computer Science, Third edition, 173-203.
%H Reinhard Zumkeller, <a href="/A004019/b004019.txt">Table of n, a(n) for n = 0..11</a> (shortened by _N. J. A. Sloane_, Jan 13 2019)
%H Geir Agnarsson, Elie Alhajjar, and Aleyah Dawkins, <a href="https://arxiv.org/abs/2312.11379">On locally finite ordered rooted trees and their rooted subtrees</a>, arXiv:2312.11379 [math.CO], 2023.
%H A. V. Aho and N. J. A. Sloane, <a href="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, <a href="http://neilsloane.com/doc/doubly.html">alternative link</a>.
%H Andressa Paola Cordeiro, Alexandre Tavares Baraviera, and Alex Jenaro Becker, <a href="https://arxiv.org/abs/2307.05850">Entropy for k-trees defined by k transition matrices</a>, arXiv:2307.05850 [math.DS], 2023. See p. 15.
%H F. Disanto and N. A. Rosenberg, <a href="https://doi.org/10.1089/cmb.2016.0159">Enumeration of ancestral configurations for matching gene trees and species trees</a>, J. Comput. Biol. 24 (2017), 831-850.
%H R. P. Stanley, <a href="/A003277/a003277.pdf">Letter to N. J. A. Sloane, c. 1991</a>
%H Elmar Teufl and Stephan Wagner, <a href="http://dx.doi.org/10.1016/j.jcta.2007.01.007">Enumeration problems for classes of self-similar graphs</a>, Journal of Combinatorial Theory, Series A, Volume 114, Issue 7, October 2007, Pages 1254-1277.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Herbrand_structure">Herbrand Structure</a>
%H Damiano Zanardini, <a href="http://costa.fdi.ucm.es/~damiano/teaching/emcl/cl_08_09/slides/12lprog.pdf">Computational Logic</a>, UPM European Master in Computational Logic (EMCL) School of Computer Science Technical University of Madrid.
%H <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>
%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F a(n) = A003095(n)^2 = A003095(n+1) - 1 = A056207(n+1) + 1.
%F It follows from Aho and Sloane that there is a constant c such that a(n) is the nearest integer to c^(2^n). In fact a(n+1) = nearest integer to b^(2^n) - 1 where b = 2.25851845058946539883779624006373187243427469718511465966.... - _Henry Bottomley_, Aug 30 2005
%F a(n) is the number of root ancestral configurations for fully symmetric matching gene trees and species trees with 2^n leaves, a(n) = A355108(2^n). - _Noah A Rosenberg_, Jun 22 2022
%t Table[Nest[(1 + #)^2 &, 0, n], {n, 0, 12}] (* _Vladimir Joseph Stephan Orlovsky_, Jul 20 2011 *)
%t NestList[(#+1)^2&,0,10] (* _Harvey P. Dale_, Oct 08 2011 *)
%o (Haskell)
%o a004019 n = a004019_list !! n
%o a004019_list = iterate (a000290 . (+ 1)) 0
%o -- _Reinhard Zumkeller_, Feb 01 2013
%o (Magma) [n le 1 select 0 else (Self(n-1)+1)^2: n in [1..15]]; // _Vincenzo Librandi_, Oct 05 2015
%o (PARI) a(n) = if(n==0, 0, (a(n-1) + 1)^2);
%o vector(20, n, a(n-1)) \\ _Altug Alkan_, Oct 06 2015
%Y Cf. A001699, A056207.
%Y Cf. A000290.
%Y Cf. A003095, A091980, A355108.
%K nonn,easy,nice
%O 0,3
%A _N. J. A. Sloane_
%E One more term from _Henry Bottomley_, Jul 24 2000
%E Additional comments from _Max Alekseyev_, Aug 30 2005
| 