a(n)^2 is the least possible value at the root of a binary tree of height n where all nodes hold positive squares and all interior nodes also equal the sum of their two children.
A309167
a(n)^2 is the least possible value at the root of a binary tree of height n where all nodes hold positive squares and all interior nodes also equal the sum of their two children.
Terms
- a(0) =1a(1) =5a(2) =13a(3) =65a(4) =97a(5) =229a(6) =997a(7) =1145a(8) =2245a(9) =5725a(10) =7213a(11) =9805a(12) =10445a(13) =24193a(14) =34121a(15) =37321a(16) =52225a(17) =83729a(18) =98449a(19) =125233a(20) =145493a(21) =156925a(22) =171037a(23) =260893a(24) =334981a(25) =345725a(26) =457813a(27) =576757a(28) =755173a(29) =806885
External references
- oeis: A309167