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!)
A278488 a(n) = A276573(n) modulo 8. 2

%I #7 Nov 29 2016 22:39:11

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

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

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

%N a(n) = A276573(n) modulo 8.

%H Antti Karttunen, <a href="/A278488/b278488.txt">Table of n, a(n) for n = 0..10028</a>

%F a(n) = A010877(A276573(n)) = A276573(n) modulo 8.

%o (Scheme) (define (A278488 n) (modulo (A276573 n) 8))

%Y Cf. A010877, A276573, A276575, A278499.

%K nonn

%O 0,2

%A _Antti Karttunen_, Nov 28 2016

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