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

%I #15 Oct 21 2023 21:24:12

%S 5,14,27,2,65,90,119,14,189,230,29,324,3,434,57,560,629,84,27,860,945,

%T 128,1127,1224,167,4,1539,12,227,82,57,278,2277,44,2555,82,2849,3002,

%U 417,3320,3485,3654,5,4004,4185,584,223,4752,4949,692,5355,84,65,208,6215

%N a(n) = min( x : x^3+n^3+x^2+n^2+x+n=1 mod(x+n)).

%C It appears that a(n) = A014106(n-1) for n in A066049. - _Michel Marcus_, Feb 17 2021

%F 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.

%o (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

%Y Cf. A014106, A066451.

%K nonn

%O 2,1

%A _Benoit Cloitre_, Jan 02 2002

%E More terms from _Michel Marcus_, Feb 17 2021

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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)