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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086858 Let f(n) be the inverse of the function g(n)=n^n. Then this sequence is the range of floor(f(n)). 0
1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

This sequence is the all the solutions to the equation n^n=a for 0<a<infinity, truncated to an integer.

FORMULA

a(n) = floor(g^-1(n)) where g(n)=n^n.

EXAMPLE

a(32)=3 because if you floor the solution to the equation n^n=32, you arrive at 3.

MATHEMATICA

f[n_] := Floor[ N[ Log[n]/ProductLog[Log[ n]]]]; Join[{1}, Table[ f[n], {n, 2, 105}]] (from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 21 2005)

CROSSREFS

Cf. A000312.

Sequence in context: A194698 A105519 A111891 * A111892 A108248 A087104

Adjacent sequences:  A086855 A086856 A086857 * A086859 A086860 A086861

KEYWORD

easy,nonn

AUTHOR

Christopher M. Tomaszewski (cmt1288(AT)comcast.net), Sep 16 2003

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:57 EST 2012. Contains 205810 sequences.