A053840 (Sum of digits of n written in base 5) modulo 5.
0, 1, 2, 3, 4, 1, 2, 3, 4, 0, 2, 3, 4, 0, 1, 3, 4, 0, 1, 2, 4, 0, 1, 2, 3, 1, 2, 3, 4, 0, 2, 3, 4, 0, 1, 3, 4, 0, 1, 2, 4, 0, 1, 2, 3, 0, 1, 2, 3, 4, 2, 3, 4, 0, 1, 3, 4, 0, 1, 2, 4, 0, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 4, 0, 3, 4, 0, 1, 2, 4, 0, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 4, 0, 2, 3, 4, 0, 1, 4, 0, 1, 2, 3
Offset: 0
Links
- Michael De Vlieger, Table of n, a(n) for n = 0..10000
- Glen Joyce C. Dulatre, Jamilah V. Alarcon, Vhenedict M. Florida and Daisy Ann A. Disu, On Fractal Sequences, DMMMSU-CAS Science Monitor (2016-2017) Vol. 15 No. 2, 109-113.
- Robert Walker, Self Similar Sloth Canon Number Sequences
Programs
-
Mathematica
Mod[Total@ IntegerDigits[#, 5], 5] & /@ Range[0, 120] (* Michael De Vlieger, May 17 2016 *)
-
PARI
a(n) = vecsum(digits(n,5)) % 5; \\ Michel Marcus, May 16 2016
Comments