login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098239 Numbers n such that n^3 differs from smallest k > n that makes n^6+1 divide k^6+1. 1
1, 2, 6, 8, 47, 136, 177 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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

a(8) > 10^6.

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}] (from Robert G. Wilson v Sep 03 2004)

CROSSREFS

Sequence in context: A118211 A050552 A105607 * A140257 A204546 A192534

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 (rgwv(AT)rgwv.com), Sep 03 2004

Lower bound for a(8) updated by Max Alekseyev (maxale(AT)gmail.com), Oct 13 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.