|
%I #22 Mar 15 2014 13:53:51
%S 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,7,21,2,1,59,
%U 5,49,2,19,57,20,45,35,30,0,5,28,50,4,19,50,23,32,10,23,38,16,45,29,6
%N Value of (n+1)-th digit in sexagesimal representation of n^n.
%C a(n) = d(n) with n^n = Sum(d(k)*60^k: 0 <= d(k) < 60, k >= 0).
%H Charles R Greathouse IV, <a href="/A088157/b088157.txt">Table of n, a(n) for n = 0..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Sexagesimal.html">Sexagesimal</a>
%F a(n) = floor(n^n / 60^n) mod 60.
%e a(0) = 1, a(k) = 0 for 0 < k < 60 and a(60) = 1.
%t f[n_] := IntegerDigits[n^n, 60, n + 1][[1]]; f[0] = 1; Array[f, 92, 0] (* _Robert G. Wilson v_, Dec 27 2012 *)
%o (PARI) a(n)=lift(chinese(chinese(Mod(n,3^(n+1))^n,Mod(n,4^(n+1))^n), Mod(n,5^(n+1))^n))\60^n \\ _Charles R Greathouse IV_, Dec 27 2012
%o (Haskell)
%o a088157 n = mod (div (n ^ n) (60 ^ n)) 60
%o -- _Reinhard Zumkeller_, Mar 14 2014
%Y Cf. A000312, A088150, A088151, A088152, A088153, A088154, A088155, A088156, A159991.
%K nonn,base,look
%O 0,62
%A _Reinhard Zumkeller_, Sep 20 2003
|
