Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #30 Oct 18 2021 05:51:46
%S 0,1,2,3,4,5,6,7,8,9,10,11,12,13,1,2,3,4,5,6,7,8,9,10,11,12,13,14,2,3,
%T 4,5,6,7,8,9,10,11,12,13,14,15,3,4,5,6,7,8,9,10,11,12,13,14,15,16,4,5,
%U 6,7,8,9,10,11,12,13,14,15,16,17,5,6,7,8,9,10,11,12,13,14,15,16,17,18
%N Sum of digits of n written in base 14.
%H Tanar Ulric, <a href="/A053834/b053834.txt">Table of n, a(n) for n = 0..10000</a>
%H Jeffrey O. Shallit, <a href="http://www.jstor.org/stable/2322179">Problem 6450</a>, Advanced Problems, The American Mathematical Monthly, Vol. 91, No. 1 (1984), pp. 59-60; <a href="http://www.jstor.org/stable/2322523">Two series, solution to Problem 6450</a>, ibid., Vol. 92, No. 7 (1985), pp. 513-514.
%H Robert Walker, <a href="https://web.archive.org/web/20190411111921/http://robertinventor.com/ftswiki/Self_Similar_Sloth_Canon_Number_Sequences">Self Similar Sloth Canon Number Sequences</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DigitSum.html">Digit Sum</a>.
%F From _Benoit Cloitre_, Dec 19 2002: (Start)
%F a(0) = 0, a(14n+i) = a(n)+i for 0 <= i <= 13.
%F a(n) = n-13*(Sum_{k>0} floor(n/14^k)). (End)
%F a(n) = A138530(n,14) for n > 13. - _Reinhard Zumkeller_, Mar 26 2008
%F Sum_{n>=1} a(n)/(n*(n+1)) = 14*log(14)/13 (Shallit, 1984). - _Amiram Eldar_, Jun 03 2021
%e a(20) = 1 + 6 = 7 because 20 is written as "16" in base 14.
%t Array[Total[IntegerDigits[#,14]]&,90,0] (* _Harvey P. Dale_, Jul 16 2011 *)
%o (PARI) a(n)=if(n<1,0,if(n%14,a(n-1)+1,a(n/14)))
%o (PARI) a(n) = sumdigits(n, 14); \\ _Michel Marcus_, Jun 03 2021
%Y Cf. A000120, A007953, A138530.
%K base,nonn
%O 0,3
%A _Henry Bottomley_, Mar 28 2000