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!)
A278499 a(n) = A276573(n) modulo 4. 5
0, 3, 2, 0, 3, 3, 0, 2, 1, 0, 3, 2, 0, 3, 2, 0, 3, 1, 0, 3, 1, 0, 3, 3, 0, 3, 2, 0, 3, 2, 0, 3, 1, 0, 2, 1, 0, 3, 2, 1, 0, 0, 3, 1, 0, 3, 2, 0, 3, 2, 0, 3, 3, 0, 3, 1, 0, 3, 2, 0, 2, 1, 0, 3, 1, 0, 3, 3, 2, 1, 0, 3, 2, 0, 3, 3, 2, 1, 0, 3, 1, 0, 3, 3, 1, 0, 0, 3, 1, 0, 3, 3, 0, 3, 1, 0, 3, 2, 0, 3, 1, 0, 3, 2, 0, 3, 2, 0, 2, 1, 0, 2, 1, 0, 3, 2, 0, 3, 2, 0, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
No subsequence 2, 3 will ever occur.
LINKS
FORMULA
a(n) = A010873(A276573(n)) = A276573(n) modulo 4.
PROG
(Scheme) (define (A278499 n) (modulo (A276573 n) 4))
CROSSREFS
Sequence in context: A286368 A190710 A114907 * A231132 A290327 A131732
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 25 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 17:25 EDT 2024. Contains 371254 sequences. (Running on oeis4.)