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!)
A105332 a(n) = n*(n+1)/2 mod 8. 2

%I #14 Mar 12 2024 14:19:02

%S 0,1,3,6,2,7,5,4,4,5,7,2,6,3,1,0,0,1,3,6,2,7,5,4,4,5,7,2,6,3,1,0,0,1,

%T 3,6,2,7,5,4,4,5,7,2,6,3,1,0,0,1,3,6,2,7,5,4,4,5,7,2,6,3,1,0,0,1,3,6,

%U 2,7,5,4,4,5,7,2,6,3,1,0,0,1,3,6,2,7,5,4,4,5,7,2,6,3,1,0,0,1,3,6,2,7,5,4,4

%N a(n) = n*(n+1)/2 mod 8.

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

%t Mod[Accumulate[Range[0,110]],8] (* _Harvey P. Dale_, Nov 03 2013 *)

%Y Cf. A000217.

%Y See A105198 for further information.

%K nonn,easy

%O 0,3

%A _Oscar Takeshita_, May 01 2005

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 March 29 09:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)