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.

A279486 Indices k such that A279484(k) = 0.

Original entry on oeis.org

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, 31, 32, 33, 34, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 74, 75, 76, 77
Offset: 1

Views

Author

Vaclav Kotesovec, Dec 13 2016

Keywords

Comments

This is different from A001476, first difference: a(450) = 540, A001476(450) = 542.
Conjecture: for k > 353684 there are no more terms in this sequence (tested for k < 1000000).

Examples

			3 is in the sequence because A279484(3) = 0
8 is not in the sequence because A279484(8) = -1
344739 is in the sequence because A279484(344739) = 0
353684 is in the sequence because A279484(353684) = 0
		

Crossrefs

Programs

  • Mathematica
    nn = 10; A279484 = Rest[CoefficientList[Series[Product[(1-x^(k^3)), {k, nn}], {x, 0, nn^3}], x]]; Select[Range[nn^3], A279484[[#]]==0&]
    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&]