|
%I #14 Aug 19 2022 09:26:01
%S 1,1,1,1,2,1,1,1,1,2,1,1,3,1,2,1,3,1,1,2,1,1,1,1,3,3,1,1,3,2,1,1,1,3,
%T 2,1,3,1,3,2,3,1,1,1,2,1,1,1,1,3,3,3,3,1,2,1,1,3,1,2,3,1,1,1,4,1,1,3,
%U 1,2,1,1,3,3,3,1,1,3,1,2,1,3,1,1,4,1,3
%N a(n) is the greatest possible height of a binary tree where all nodes hold positive squares and all interior nodes also equal the sum of their two children and the root node has value n^2.
%C The sequence is unbounded and for any k > 0, A309167(k) is the least n such that a(n) = k.
%H Robert Israel, <a href="/A309228/b309228.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = 1 iff n belongs to A004144.
%F a(A309167(n)) = n.
%F If n^2 = u^2 + v^2 with u > v > 0, then a(n) >= 1 + max(a(u), a(v)).
%e a(1) = 1:
%e 1^2
%e |
%e a(5) = 2:
%e 3^2 4^2
%e \ /
%e \ /
%e 5^2
%e |
%e a(13) = 3:
%e 3^2 4^2
%e \ /
%e \ /
%e 5^2 12^2
%e \ /
%e \ /
%e 13^2
%e |
%p f:= proc(n) option remember; local S,x,y;
%p S:= map(t -> subs(t,[x,y]), {isolve(x^2+y^2=n^2)});
%p S:= select(t -> type(t,list(posint)) and t[2]>=t[1], S);
%p if S = {} then 1 else 1+max(map(procname,map(op,S))) fi
%p end proc:
%p map(f, [$1..100]); # _Robert Israel_, Feb 27 2022
%t a = Table[1, {m = 100}];
%t Do[Do[If[IntegerQ@ Sqrt[v2 = n^2-u^2], a[[n]] = Max[a[[n]], 1+Max[a[[u]], a[[Floor@ Sqrt[v2]]]]]], {u, 1, n-1}], {n, 1, m}];
%t Table[a[[n]], {n, 1, m}] (* _Jean-François Alcover_, Aug 19 2022, after PARI code *)
%o (PARI) a = vector(87,n,1); for (n=1, #a, for (u=1, n-1, if (issquare(v2=n^2-u^2), a[n]=max(a[n],1+max(a[u],a[sqrtint(v2)])))); print1 (a[n]", "))
%Y Cf. A004144, A309167.
%K nonn
%O 1,5
%A _Rémy Sigrist_, Jul 16 2019
|
