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!)
A066479 a(n) = min( x : x^3+n^3+x^2+n^2+x+n=1 mod(x+n)). 0
5, 14, 27, 2, 65, 90, 119, 14, 189, 230, 29, 324, 3, 434, 57, 560, 629, 84, 27, 860, 945, 128, 1127, 1224, 167, 4, 1539, 12, 227, 82, 57, 278, 2277, 44, 2555, 82, 2849, 3002, 417, 3320, 3485, 3654, 5, 4004, 4185, 584, 223, 4752, 4949, 692, 5355, 84, 65, 208, 6215 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
It appears that a(n) = A014106(n-1) for n in A066049. - Michel Marcus, Feb 17 2021
LINKS
FORMULA
a(n) = A014106(n) for n=2, 3, 4, 6, 7, 8, 10, 11, 13, 15, 17, 18, 21, 22, 24, 25, 28, 34, 36, 38, 39.
PROG
(PARI) a(n) = my(x=0); while(Mod(x^3+n^3+x^2+n^2+x+n, x+n) != 1, x++); x; \\ Michel Marcus, Feb 17 2021
CROSSREFS
Sequence in context: A202821 A301689 A367690 * A080390 A030745 A071421
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 02 2002
EXTENSIONS
More terms from Michel Marcus, Feb 17 2021
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 19 06:16 EDT 2024. Contains 371782 sequences. (Running on oeis4.)