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 A376798 #18 Oct 13 2024 11:14:12 %S A376798 1,1,2,1,2,1,2,1,3,2,3,2,3 %N A376798 Least number of inequivalent cells in a polycube with n cells. %C A376798 a(27) <= 4, a(64) <= 4. %H A376798 Pontus von Brömssen, <a href="/A376798/a376798.pdf">Inequivalent cells in polycubes</a>. %F A376798 a(n) <= A367758(n). %F A376798 From _Pontus von Brömssen_, Oct 13 2024: (Start) %F A376798 n/48 < a(n) <= n/48 + c for some constant c. c = 11 + 19/48 works for n >= 78, but that is not best possible. See link "Inequivalent cells in polycubes". %F A376798 Conjecture: The sequence (a(n)-n/48) is eventually periodic with period 48. %F A376798 (End) %Y A376798 Cf. A367758, A376797, A376799. %K A376798 nonn,more %O A376798 1,3 %A A376798 _John Mason_, Oct 04 2024