login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053840 (Sum of digits of n written in base 5) modulo 5. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(n) is the fourth row of the array in A141803, so a(n) = A141803(A055998(n+1)) for n>0. - Andrey Zabolotskiy, May 16 2016

LINKS

Michael De Vlieger, Table of n, a(n) for n = 0..10000

Glen Joyce C. Dulatre, Jamilah V. Alarcon, Vhenedict M. Florida, 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

FORMULA

a(n) = A010874(A053824(n)). - Andrey Zabolotskiy, May 18 2016

MATHEMATICA

Mod[Total@ IntegerDigits[#, 5], 5] & /@ Range[0, 120] (* Michael De Vlieger, May 17 2016 *)

PROG

(PARI) a(n) = vecsum(digits(n, 5)) % 5; \\ Michel Marcus, May 16 2016

CROSSREFS

Cf. A010060.

Sequence in context: A256914 A171171 A159957 * A010883 A011542 A260688

Adjacent sequences:  A053837 A053838 A053839 * A053841 A053842 A053843

KEYWORD

base,nonn

AUTHOR

Henry Bottomley, Mar 28 2000

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 07:00 EDT 2018. Contains 316307 sequences. (Running on oeis4.)