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!)
A246864 (n^4+1) mod prime(n). 1

%I #16 Sep 08 2022 08:46:09

%S 0,2,2,5,10,10,5,12,7,25,10,17,26,18,7,29,37,57,7,38,10,22,49,74,7,53,

%T 65,49,90,17,105,53,50,130,47,44,53,41,158,120,68,126,93,37,71,156,96,

%U 125,137,133,47,129,142,181,141,138,173,79,274,0,67,54,178,11

%N (n^4+1) mod prime(n).

%C Let p be a prime: n^4+1 == 0 (mod p) if p = 2 or p == 1 (mod 8).

%H Vincenzo Librandi, <a href="/A246864/b246864.txt">Table of n, a(n) for n = 1..1000</a>

%t Table[Mod[n^4 + 1, Prime[n]], {n, 70}]

%o (Magma) [(n^4+1) mod NthPrime(n): n in [1..70]];

%o (PARI) a(n)=(n^4+1)%prime(n) \\ _Edward Jiang_, Sep 05 2014

%Y Cf. A000040.

%K nonn

%O 1,2

%A _Vincenzo Librandi_, Sep 05 2014

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 August 19 12:02 EDT 2024. Contains 375296 sequences. (Running on oeis4.)