The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A279486 Indices k such that A279484(k) = 0. 7
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 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). LINKS Vaclav Kotesovec, Table of n, a(n) for n = 1..5216 EXAMPLE 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 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&] CROSSREFS Cf. A001476, A001661, A276517, A279484. Sequence in context: A073678 A210947 A031981 * A001476 A336063 A336064 Adjacent sequences: A279483 A279484 A279485 * A279487 A279488 A279489 KEYWORD nonn AUTHOR Vaclav Kotesovec, Dec 13 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 14 03:00 EDT 2024. Contains 371652 sequences. (Running on oeis4.)