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.

A290276 Numbers that are the sum of distinct odd positive cubes.

This page as a plain text file.
%I A290276 #13 Sep 23 2017 03:41:13
%S A290276 1,27,28,125,126,152,153,343,344,370,371,468,469,495,496,729,730,756,
%T A290276 757,854,855,881,882,1072,1073,1099,1100,1197,1198,1224,1225,1331,
%U A290276 1332,1358,1359,1456,1457,1483,1484,1674,1675,1701,1702,1799,1800,1826,1827,2060,2061,2087,2088,2185,2186,2197,2198,2212
%N A290276 Numbers that are the sum of distinct odd positive cubes.
%C A290276 Complement of A292740.
%H A290276 Robert Israel, <a href="/A290276/b290276.txt">Table of n, a(n) for n = 1..10000</a>
%H A290276 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%e A290276 881 is in the sequence because 881 = 27 + 125 + 729 = 3^3 + 5^3 + 9^3.
%p A290276 N:= 10000: # to get all terms <= N
%p A290276 M:= floor(N^(1/3)):
%p A290276 G:= mul(1+x^(j^3),j=1..M,2):
%p A290276 S:= series(G,x,N+1):
%p A290276 select(t -> coeff(S,x,t)>0, [$1..N]); # _Robert Israel_, Jul 26 2017
%t A290276 max = 2212; f[x_] := Product[1 + x^(2 k + 1)^3, {k, 0, 8}]; Exponent[#, x] & /@ List @@ Normal[Series[f[x], {x, 0, max}]] // Rest
%Y A290276 Cf. A003997, A016755, A287091, A290275.
%K A290276 nonn
%O A290276 1,2
%A A290276 _Ilya Gutkovskiy_, Jul 25 2017