|
%I #16 Jul 07 2020 06:30:52
%S 1,1,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%T 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%U 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3
%N Smallest integer i such that TREE(i) >= n.
%C The sequence grows very slowly.
%C A rooted tree is a tree containing one special node labeled the "root".
%C TREE(n) gives the largest integer k such that a sequence T(1), T(2), ..., T(k) of vertex-colored (using up to n colors) rooted trees, each one T(i) having at most i vertices, exists such that T(i) <= T(j) does not hold for any i < j <= k. - Edited by _Gus Wiseman_, Jul 06 2020
%H Priyabrata Biswas, <a href="https://towardsdatascience.com/how-big-is-the-number-tree-3-61b901a29a2c">Towards Data Science: How Big Is The Number — Tree(3)</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/RootedTree.html">Rooted Tree</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Hyperoperation#Notations">Hyperoperation - Notations</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Kruskal%27s_tree_theorem">Kruskal's tree theorem</a>
%e TREE(1) = 1, so a(n) = 1 for n <= 1.
%e TREE(2) = 3, so a(n) = 2 for 2 <= n <= 3.
%e TREE(3) > A(A(...A(1)...)), where A(x) = 2[x+1]x is a variant of Ackermann's function, a[n]b denotes a hyperoperation and the number of nested A() functions is 187196, so a(n) = 3 for at least 4 <= n <= A^A(187196)(1).
%Y Cf. A090529, A300403, A300404.
%Y Labeled rooted trees are counted by A000169 and A206429.
%Y Cf. A000081, A000311, A060313, A060356, A317713.
%K nonn
%O 0,3
%A _Felix Fröhlich_, Mar 05 2018
|
