|
%I #12 Oct 23 2012 06:47:54
%S 2,3,2,3,1,0,2,4,1,9,6,9,14,9,5,0,14,11,19,3,20,7,18,25,5,2,24,12,5,
%T 28,9,18,0,8,0,10,26,12,3,30,21,19,24,37,27,39,17,14,36,35,24,3,32,17,
%U 42,1,47,56,44,0,11,50,21,2,55,55,17,5,61,69,55,3,14,14,59,38,22,62
%N Sum modulo n of all the digits of n in every base from 2 to n-1.
%H Vincenzo Librandi, <a href="/A014836/b014836.txt">Table of n, a(n) for n = 3..10000</a>
%F a(n)=A014837(n) mod n. [From _R. J. Mathar_, Aug 10 2008]
%t Table[ Mod[Plus@@Table[Plus@@IntegerDigits[n,k],{k,2,n-1}],n],{n,3,100}]
%Y Cf. A014834, A014837, A116987.
%K nonn,base
%O 3,1
%A _Olivier Gérard_
|
