login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088157 Value of (n+1)-th digit in sexagesimal representation of n^n. 9
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,62

COMMENTS

a(n) = d(n) with n^n = Sum(d(k)*60^k: 0 <= d(k) < 60, k >= 0).

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 0..10000

Eric Weisstein's World of Mathematics, Sexagesimal

FORMULA

a(n) = floor(n^n / 60^n) mod 60.

EXAMPLE

a(0) = 1, a(k) = 0 for 0 < k < 60 and a(60) = 1.

MATHEMATICA

f[n_] := IntegerDigits[n^n, 60, n + 1][[1]]; f[0] = 1; Array[f, 92, 0] (* Robert G. Wilson v, Dec 27 2012 *)

PROG

(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

(Haskell)

a088157 n = mod (div (n ^ n) (60 ^ n)) 60

-- Reinhard Zumkeller, Mar 14 2014

CROSSREFS

Cf. A000312, A088150, A088151, A088152, A088153, A088154, A088155, A088156, A159991.

Sequence in context: A009697 A139012 A132605 * A265316 A079034 A265500

Adjacent sequences:  A088154 A088155 A088156 * A088158 A088159 A088160

KEYWORD

nonn,base,look

AUTHOR

Reinhard Zumkeller, Sep 20 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 25 13:09 EDT 2017. Contains 292486 sequences.