A173525 a(n) = 1 + A053824(n-1), where A053824 = sum of digits in base 5.
1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 7, 8, 9, 10, 11, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12
Offset: 1
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..3126=5^5+1
- Robert Walker, Self Similar Sloth Canon Number Sequences
Programs
-
Haskell
a173525 = (+ 1) . a053824 . (subtract 1) -- Reinhard Zumkeller, Jan 31 2014
-
Maple
A053825 := proc(n) add(d, d=convert(n,base,5)) ; end proc: A173525 := proc(n) local b,k; b := 5 ; if n < b then n; else k := n/(b-1); k := ceil(log(k)/log(b)) ; A053825(b^k+n-1) ; end if; end proc: seq(A173525(n),n=1..100) ;
-
Mathematica
Total[IntegerDigits[#,5]]+1&/@Range[0,100] (* Harvey P. Dale, Jun 14 2015 *)
-
PARI
A173525(n)={ my(s=1); n--; until(!n\=5, s+=n%5); s } \\ M. F. Hasler, Dec 09 2010
-
PARI
A173525(n)={ my(s=1+(n=divrem(n-1,5))[2]); while((n=divrem(n[1],5))[1],s+=n[2]); s+n[2] } \\ M. F. Hasler, Dec 09 2010
Formula
a(n) = A053824(5^k + n - 1) where k >= ceiling(log_5(n/4)). - R. J. Mathar, Dec 09 2010
Extensions
More terms from Vincenzo Librandi, Aug 02 2010
Comments