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.

A298937 Number of ordered ways of writing n^2 as a sum of n positive cubes.

This page as a plain text file.
%I A298937 #4 Jan 29 2018 21:12:22
%S A298937 1,1,0,0,0,0,0,7,1,0,0,9240,34650,1716,48477,551915,6726720,89973520,
%T A298937 102639744,1824625081,9915389400,30143458884,278196062760,
%U A298937 1995766236541,6611689457736,64547920386450,236756174748626,2315743488707806
%N A298937 Number of ordered ways of writing n^2 as a sum of n positive cubes.
%H A298937 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%F A298937 a(n) = [x^(n^2)] (Sum_{k>=1} x^(k^3))^n.
%e A298937 a(7) = 7 because we have [8, 8, 8, 8, 8, 8, 1], [8, 8, 8, 8, 8, 1, 8], [8, 8, 8, 8, 1, 8, 8], [8, 8, 8, 1, 8, 8, 8], [8, 8, 1, 8, 8, 8, 8], [8, 1, 8, 8, 8, 8, 8] and [1, 8, 8, 8, 8, 8, 8].
%t A298937 Join[{1}, Table[SeriesCoefficient[Sum[x^k^3, {k, 1, Floor[n^(2/3) + 1]}]^n, {x, 0, n^2}], {n, 1, 27}]]
%Y A298937 Cf. A000290, A000578, A023358, A030272, A218495, A259792, A291700, A298671, A298672, A298934, A298936.
%K A298937 nonn
%O A298937 0,8
%A A298937 _Ilya Gutkovskiy_, Jan 29 2018