This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A199085 #34 Oct 04 2014 10:51:20 %S A199085 1,1,2,4,7,11,15,20,26,32,39,47,55,64,74,84,95,107,119,132,146,160, %T A199085 175,191,207,224,242,260,279,299,319,340,362,384,407,431,455,480,506, %U A199085 532,559,587,615,644,674,704,735,767,799,832,866,900,935,971,1007,1044 %N A199085 Number of distinct values taken by 3rd derivative of x^x^...^x (with n x's and parentheses inserted in all possible ways) at x=1. %C A199085 Number of distinct values taken by 0th and 1st derivative is 1,1,1,1,1,1,... and by 2nd is 1,1,2,3,4,5,... %F A199085 Conjectured g.f.: (x^6-2*x^4-x^2+x-1)*x/(x^5-2*x^4+x^3-x^2+2*x-1). - _Alois P. Heinz_, Nov 02 2011 %e A199085 For n=5 there are 7 distinct values: 9, 15, 18, 21, 24, 33, 48, they are given by 3rd derivatives of the following parenthesizations at x=1: x^(x^((x^x)^x)), x^((x^(x^x))^x), (x^x)^(x^(x^x)), x^(((x^x)^x)^x), (x^(x^x))^(x^x), (((x^(x^x)))^x)^x, (((x^x)^x)^x)^x. So a(5)=7. %p A199085 f:= proc(n) option remember; %p A199085 `if`(n=1, {[0, 0]}, {seq(seq(seq([2+g[1], 3*(1+g[1]+h[1])+g[2]], %p A199085 h=f(n-j)), g=f(j)), j=1..n-1)}) %p A199085 end: %p A199085 a:= n-> nops(map(x-> x[2], f(n))): %p A199085 seq(a(n), n=1..40); # _Alois P. Heinz_, Nov 03 2011 %t A199085 f[1] = {x}; f[n_] := Flatten[Table[Outer[Power, f[k], f[n-k]], {k, n-1}]]; Table[Length[Union[D[f[n], {x, 3}] /. x -> 1]], {n, 1, 8}] (* Reshetnikov *) %t A199085 Table[If[n<3,1,Floor[(n^2-2)/3]],{n,1,100}] (* _Vladimir Joseph Stephan Orlovsky_, Feb 01 2012 *) %Y A199085 Cf. A000081 (upper bound), A000108, A199205 (4th derivatives), A199296 (5th derivatives), A215703, A215842. Column k=3 of A216368. %K A199085 nonn %O A199085 1,3 %A A199085 _Vladimir Reshetnikov_, Nov 02 2011 %E A199085 a(13)-a(56) from _Alois P. Heinz_, Nov 02 2011