Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061505
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061505 Leading digit of n^n. +0
3
1, 4, 2, 2, 3, 4, 8, 1, 3, 1, 2, 8, 3, 1, 4, 1, 8, 3, 1, 1, 5, 3, 2, 1, 8, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 5, 6, 8, 1, 1, 2, 3, 5, 7, 1, 1, 3, 4, 8, 1, 2, 3, 6, 1, 2, 4, 7, 1, 2, 5, 1, 2, 4, 8, 1, 3, 8, 1, 3, 8, 1, 4, 1, 2, 5, 1, 3, 7, 1, 4, 1, 2, 7, 1, 5, 1, 3, 1, 2, 7, 2, 5, 1 (list; graph; listen)
OFFSET

1,2

FORMULA

Using the formula in A000030: a(n) = [n^n / 10^([log_10(n^n)])] = [n^n / 10^([n*log_10(n)])]

EXAMPLE

a(7) = 8, as 7^7 = 823543.

MATHEMATICA

a = {}; Do[ a = Append[ a, IntegerDigits[ n^n ] [ [ 1 ] ] ], {n, 1, 75 } ]; a

CROSSREFS

Sequence in context: A112349 A062072 A140395 this_sequence A053879 A141035 A100854

Adjacent sequences: A061502 A061503 A061504 this_sequence A061506 A061507 A061508

KEYWORD

base,nonn,easy

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 06 2001

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), May 10 2001. Further terms from Asher Auel (asher.auel(AT)reed.edu), May 20 2001.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 14:45 EST 2009. Contains 167481 sequences.


AT&T Labs Research