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.

A051343 Number of ways of writing n as a sum of 3 nonnegative cubes (counted naively).

This page as a plain text file.
%I A051343 #11 Mar 06 2020 00:07:39
%S A051343 1,3,3,1,0,0,0,0,3,6,3,0,0,0,0,0,3,3,0,0,0,0,0,0,1,0,0,3,6,3,0,0,0,0,
%T A051343 0,6,6,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,3,3,0,0,0,0,0,0,3,0,3,6,3,0,
%U A051343 0,0,0,0,6,6,0,0,0,0,0,0,3,1,0,0,0,0,0,0,0,0,0,6,6
%N A051343 Number of ways of writing n as a sum of 3 nonnegative cubes (counted naively).
%H A051343 Charles R Greathouse IV, <a href="/A051343/b051343.txt">Table of n, a(n) for n = 0..10000</a>
%p A051343 series(add(x^(n^3), n=0..10)^3,x,1000);
%o A051343 (PARI) first(n)=my(s=vector(n+1)); for(k=0,sqrtnint(n,3), s[k^3+1]=1); Vec(Ser(s,,n+1)^3) \\ _Charles R Greathouse IV_, Sep 16 2016
%Y A051343 Cf. A051344.
%Y A051343 Sums of k cubes, number of ways of writing n as, for k=1..9: A010057, A173677, A051343, A173678, A173679, A173680, A173676, A173681, A173682.
%K A051343 nonn,easy
%O A051343 0,2
%A A051343 _N. J. A. Sloane_