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 A334012 #18 Feb 16 2025 08:34:00 %S A334012 1,1045,5985 %N A334012 a(n) is the least integer that can be expressed as the sum of one or more consecutive nonzero octagonal numbers in exactly n ways. %H A334012 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/OctagonalNumber.html">Octagonal Number</a> %H A334012 <a href="/index/Pol#polygonal_numbers">Index to sequences related to polygonal numbers</a> %e A334012 From _Seiichi Manyama_, May 16 2021: (Start) %e A334012 Let S(k, m) denote the sum of m octagonal numbers starting from k*(3*k-2). We have %e A334012 a(1) = S(1, 1); %e A334012 a(2) = S(19, 1) = S(1, 10); %e A334012 a(3) = S(45, 1) = S(11, 9) = S(1, 18). (End) %Y A334012 Cf. A000567, A054859, A068314, A186337, A298467, A322637, A334007, A334008, A334010, A334011, A344376. %K A334012 nonn,hard,more %O A334012 1,2 %A A334012 _Ilya Gutkovskiy_, Apr 12 2020