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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066486 a(n) = min( x : x^3 + n^3 == 0 mod (x+n-1) ). 0
1, 6, 17, 34, 57, 2, 121, 6, 23, 262, 321, 386, 55, 534, 617, 88, 3, 902, 61, 144, 77, 52, 9, 1634, 1777, 1926, 17, 2242, 2409, 344, 2761, 198, 3137, 4, 3537, 164, 535, 4182, 4409, 112, 93, 5126, 5377, 768, 413, 6166, 453, 920, 7009, 7302, 1043, 22, 8217, 224, 13, 9186, 5, 34, 10209, 188, 19, 1560, 11657 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = 3*n^2 - 4*n + 2 for n=1, 2, 3, 4, 5, 7, 10, 11, 12, 14, 15, 18, 24, 25, 26, 28, 29, 31, 33, 35, 38, ...
That is, in those cases a(n) = A056109(n-1). It appears that the corresponding indices are given by A133431 (i.e., 1 U A002504). - Michel Marcus, Feb 17 2018
MATHEMATICA
a[n_] := For[x = 1, True, x++, If[Mod[x^3 + n^3, x + n - 1] == 0, Return[x]]]; Array[a, 24] (* Jean-François Alcover, Feb 17 2018 *)
PROG
(PARI) a(n) = {my(k=1); while((k^3+n^3)%(k+n-1) != 0, k++); k; } \\ Altug Alkan, Feb 17 2018
CROSSREFS
Cf. A066333.
Sequence in context: A038795 A216892 A301711 * A301719 A056109 A023545
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 02 2002
EXTENSIONS
More terms from Altug Alkan, Feb 17 2018
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)