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.

A338481 Least number of octagonal numbers needed to represent n.

This page as a plain text file.
%I A338481 #5 Feb 16 2025 08:34:00
%S A338481 1,2,3,4,5,6,7,1,2,3,4,5,6,7,8,2,3,4,5,6,1,2,3,3,4,5,6,7,2,3,4,4,5,6,
%T A338481 7,8,3,4,5,1,2,2,3,4,4,5,6,2,3,3,4,5,5,6,7,3,4,4,5,6,2,3,3,4,1,2,3,4,
%U A338481 3,4,4,5,2,3,4,5,4,5,5,2,3,3,4,4,5,2,3,3,4,4,5,5,6,3,4,1,2,3,4,5,3
%N A338481 Least number of octagonal numbers needed to represent n.
%H A338481 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/OctagonalNumber.html">Octagonal Number</a>
%H A338481 <a href="/index/Pol#polygonal_numbers">Index to sequences related to polygonal numbers</a>
%Y A338481 Cf. A000567, A002828, A061336, A100878, A338479, A338480.
%K A338481 nonn
%O A338481 1,2
%A A338481 _Ilya Gutkovskiy_, Oct 29 2020