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. 2

%I

%S 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,

%T 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,

%U 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

%N (Sum of digits of n written in base 5) modulo 5.

%C 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

%H Michael De Vlieger, <a href="/A053840/b053840.txt">Table of n, a(n) for n = 0..10000</a>

%H Glen Joyce C. Dulatre, Jamilah V. Alarcon, Vhenedict M. Florida, Daisy Ann A. Disu, <a href="http://www.dmmmsu-sluc.com/wp-content/uploads/2018/03/CAS-Monitor-2016-2017-1.pdf">On Fractal Sequences</a>, DMMMSU-CAS Science Monitor (2016-2017) Vol. 15 No. 2, 109-113.

%H Robert Walker, <a href="http://robertinventor.com/ftswiki/Self_Similar_Sloth_Canon_Number_Sequences">Self Similar Sloth Canon Number Sequences</a>

%F a(n) = A010874(A053824(n)). - _Andrey Zabolotskiy_, May 18 2016

%t Mod[Total@ IntegerDigits[#, 5], 5] & /@ Range[0, 120] (* _Michael De Vlieger_, May 17 2016 *)

%o (PARI) a(n) = vecsum(digits(n,5)) % 5; \\ _Michel Marcus_, May 16 2016

%Y Cf. A010060.

%K base,nonn

%O 0,3

%A _Henry Bottomley_, Mar 28 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 20 14:54 EST 2019. Contains 329337 sequences. (Running on oeis4.)