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.

A338497 Least number of odd cubes needed to represent n.

This page as a plain text file.
%I A338497 #5 Oct 31 2020 07:07:22
%S A338497 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
%T A338497 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
%U A338497 27,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,3
%N A338497 Least number of odd cubes needed to represent n.
%H A338497 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%Y A338497 Cf. A002376, A016755, A101412.
%K A338497 nonn
%O A338497 1,2
%A A338497 _Ilya Gutkovskiy_, Oct 31 2020