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 A363199 #18 Dec 11 2023 08:23:24 %S A363199 1,1,2,7,27,138,822,5154,33880,227495,1554266,10749089,75106906 %N A363199 Number of free tree-like polycubes of size n, identifying rotations but not reflections. %C A363199 Tree-like means that the graph connecting midpoints of adjacent cubes is a tree. %C A363199 Additionally identifying reflections gives A304196. %C A363199 The fixed version is A118356. %K A363199 nonn,hard,more %O A363199 1,3 %A A363199 _Joerg Arndt_ and _Márk Péter Légrádi_, May 21 2023 %E A363199 a(12) and a(13) from _Joerg Arndt_, Dec 11 2023