The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A278488 a(n) = A276573(n) modulo 8. 2
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Antti Karttunen, Table of n, a(n) for n = 0..10028 FORMULA a(n) = A010877(A276573(n)) = A276573(n) modulo 8. PROG (Scheme) (define (A278488 n) (modulo (A276573 n) 8)) CROSSREFS Cf. A010877, A276573, A276575, A278499. Sequence in context: A178567 A182196 A334477 * A038023 A008954 A169890 Adjacent sequences:  A278485 A278486 A278487 * A278489 A278490 A278491 KEYWORD nonn AUTHOR Antti Karttunen, Nov 28 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 14 05:41 EDT 2021. Contains 342946 sequences. (Running on oeis4.)