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!)
A059018 Write 10*n in base 4; a(n) = sum of digits mod 4. 1
0, 0, 2, 2, 0, 1, 2, 0, 2, 2, 0, 0, 2, 0, 1, 2, 0, 0, 2, 2, 1, 2, 3, 0, 2, 2, 2, 2, 0, 1, 2, 3, 2, 2, 0, 0, 2, 3, 0, 2, 0, 0, 2, 2, 0, 2, 3, 0, 2, 2, 0, 0, 0, 1, 2, 3, 1, 1, 0, 0, 2, 3, 0, 1, 0, 0, 2, 2, 0, 1, 2, 0, 2, 2, 0, 0, 2, 1, 2, 3, 1, 1, 3, 3, 2, 3, 0, 1, 3, 3, 2, 2, 0, 1, 2, 3, 2, 2, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
50_10 = 302_4, so a(5) = 3+0+2 (mod 4) = 1.
MATHEMATICA
Table[Mod[Total[IntegerDigits[10n, 4]], 4], {n, 0, 120}] (* Harvey P. Dale, Apr 02 2022 *)
CROSSREFS
Sequence in context: A079531 A182882 A134178 * A249371 A122190 A237291
KEYWORD
base,easy,nonn
AUTHOR
Robert Lozyniak (11(AT)onna.com), Feb 12 2001
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 May 12 14:10 EDT 2024. Contains 372480 sequences. (Running on oeis4.)