cp's OEIS Frontend

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.

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.

Table of values

n a(n)
1 1
2 5
3 13
4 65
5 97
6 229
7 997
8 1145
9 2245
10 5725
11 7213
12 9805
13 10445
14 24193
15 34121
16 37321
17 52225
18 83729
19 98449
20 125233
21 145493
22 156925
23 171037
24 260893
25 334981
26 345725
27 457813
28 576757
29 755173
30 806885
31 839285
32 924157

List of values

[1, 5, 13, 65, 97, 229, 997, 1145, 2245, 5725, 7213, 9805, 10445, 24193, 34121, 37321, 52225, 83729, 98449, 125233, 145493, 156925, 171037, 260893, 334981, 345725, 457813, 576757, 755173, 806885, 839285, 924157]