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!)
A070578 a(n) = n^4 mod 35. 0

%I #9 Dec 18 2023 17:31:15

%S 0,1,16,11,11,30,1,21,1,16,25,11,16,1,21,15,16,11,11,16,15,21,1,16,11,

%T 25,16,1,21,1,30,11,11,16,1,0,1,16,11,11,30,1,21,1,16,25,11,16,1,21,

%U 15,16,11,11,16,15,21,1,16,11,25,16,1,21,1,30,11,11,16,1,0,1,16,11,11,30

%N a(n) = n^4 mod 35.

%H <a href="/index/Rec#order_35">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%o (PARI) a(n)=n^4%35 \\ _Charles R Greathouse IV_, Apr 06 2016

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, May 13 2002

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 30 06:27 EDT 2024. Contains 372127 sequences. (Running on oeis4.)