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.
%I A279486 #13 Dec 14 2016 11:06:17
%S A279486 2,3,4,5,6,7,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,29,30,
%T A279486 31,32,33,34,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,
%U A279486 56,57,58,59,60,61,62,63,66,67,68,69,70,71,74,75,76,77
%N A279486 Indices k such that A279484(k) = 0.
%C A279486 This is different from A001476, first difference: a(450) = 540, A001476(450) = 542.
%C A279486 Conjecture: for k > 353684 there are no more terms in this sequence (tested for k < 1000000).
%H A279486 Vaclav Kotesovec, <a href="/A279486/b279486.txt">Table of n, a(n) for n = 1..5216</a>
%e A279486 3 is in the sequence because A279484(3) = 0
%e A279486 8 is not in the sequence because A279484(8) = -1
%e A279486 344739 is in the sequence because A279484(344739) = 0
%e A279486 353684 is in the sequence because A279484(353684) = 0
%t A279486 nn = 10; A279484 = Rest[CoefficientList[Series[Product[(1-x^(k^3)), {k, nn}], {x, 0, nn^3}], x]]; Select[Range[nn^3], A279484[[#]]==0&]
%t A279486 nmax = 1000; nn = Floor[nmax^(1/3)]+1; poly = ConstantArray[0, nn^3 + 1]; poly[[1]] = 1; poly[[2]] = -1; poly[[3]] = 0; Do[Do[poly[[j + 1]] -= poly[[j - k^3 + 1]], {j, nn^3, k^3, -1}];, {k, 2, nn}]; A279484 = Take[poly, {2, nmax+1}]; Select[Range[nmax], A279484[[#]]==0&]
%Y A279486 Cf. A001476, A001661, A276517, A279484.
%K A279486 nonn
%O A279486 1,1
%A A279486 _Vaclav Kotesovec_, Dec 13 2016