The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A336631 a(n) = 1 + Max_{0<=i<=j<=k; i+j+k=n-1} a(i)*a(j)*a(k) for n>0, with a(0) = 1. 0
 1, 2, 3, 5, 9, 13, 21, 37, 55, 91, 163, 244, 406, 730, 1054, 1702, 2998, 4456, 7372, 13204, 19765, 32887, 59131, 85411, 137971, 243091, 361351, 597871, 1070911, 1603081, 2667421, 4796101, 6927701, 11190901, 19717301, 29309501, 48493901, 86862701, 130027601 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) is the maximum number of antichains (including the empty antichain) among all posets of size n with a Hasse diagram corresponding to a ternary tree (each node has up to three children). Equivalently, a(n)-1 is the maximum number of subtrees containing the root among all ternary trees of size n. a(n)^(1/n) converges, and the decimal expansion of the limit seems to start with 1.6296636... LINKS FORMULA a(n) = 1 + Max_{0<=i<=j<=k; i+j+k=n-1} a(i)*a(j)*a(k) for n>0, a(0) = 1. EXAMPLE For n = 1 we have a(1) = 1 + a(0)*a(0)*a(0) = 1 + 1*1*1 = 2. For n = 6 we have a(6) = 1 + a(1)*a(1)*a(3) = 1 + 2*2*5 = 21. For n = 24 we have a(24) = 1 + a(4)*a(6)*a(13) = 1+9*21*730 = 137971. CROSSREFS Ternary version of A091980. Sequence in context: A085913 A060482 A018138 * A228129 A175125 A171925 Adjacent sequences:  A336628 A336629 A336630 * A336632 A336633 A336634 KEYWORD easy,nonn AUTHOR Justin Dallant, Jul 28 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 18 23:31 EDT 2022. Contains 353826 sequences. (Running on oeis4.)