A098239 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A098239

Numbers n such that n^3 differs from smallest k > n that makes n^6+1 divide k^6+1.

1, 2, 6, 8, 47, 136, 177

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

n such that A066021(n) differs from A000578(n).

a(8) > 10^6.

LINKS

Table of n, a(n) for n=1..7.

MATHEMATICA

f[n_] := Block[{k = 1, m}, While[m = (k^6 + 1)/(n^6 + 1); m < 2 || !IntegerQ[m], k++ ]; n^3 - k]; Do[ If[ f[n] != 0, Print[n]], {n, 215}] (* Robert G. Wilson v, Sep 03 2004 *)

CROSSREFS

Sequence in context: A118211 A050552 A105607 * A140257 A361427 A204546

Adjacent sequences: A098236 A098237 A098238 * A098240 A098241 A098242

KEYWORD

nonn,hard,more

AUTHOR

Ralf Stephan, Sep 01 2004

EXTENSIONS

More terms from Robert G. Wilson v, Sep 03 2004

Lower bound for a(8) updated by Max Alekseyev, Oct 13 2009

STATUS

approved