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!)
A088666 a(n) = (n^4 + 1) mod 10. 1

%I #17 Sep 08 2022 08:45:12

%S 1,2,7,2,7,6,7,2,7,2,1,2,7,2,7,6,7,2,7,2,1,2,7,2,7,6,7,2,7,2,1,2,7,2,

%T 7,6,7,2,7,2,1,2,7,2,7,6,7,2,7,2,1,2,7,2,7,6,7,2,7,2,1,2,7,2,7,6,7,2,

%U 7,2,1,2,7,2,7,6,7,2,7,2,1,2,7,2,7,6,7,2,7,2

%N a(n) = (n^4 + 1) mod 10.

%C Periodic, with period 10. - _Harvey P. Dale_, Jan 31 2015

%H Harvey P. Dale, <a href="/A088666/b088666.txt">Table of n, a(n) for n = 0..1000</a>

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

%F a(n) = A010879(A002523(n)). - _Michel Marcus_, Feb 01 2015

%t PowerMod[Range[0,90],4,10]+1 (* or *) PadRight[{},100,{1,2,7,2,7,6,7,2,7,2}] (* _Harvey P. Dale_, Jan 31 2015 *)

%t LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 0, 1},{1, 2, 7, 2, 7, 6, 7, 2, 7, 2},90] (* _Ray Chandler_, Aug 26 2015 *)

%o (Magma) [(n^4+1) mod 10: n in [0..100]]; // _Vincenzo Librandi_, Feb 01 2015

%Y Cf. A010879 (n mod 10), A002523 (n^4+1).

%K easy,nonn

%O 0,2

%A _Cino Hilliard_, Nov 23 2003

%E Edited by _Don Reble_, May 03 2006

%E Name clarified by _Vincenzo Librandi_, Feb 01 2015

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 24 09:18 EDT 2024. Contains 371935 sequences. (Running on oeis4.)