id:A086858 - OEIS Search Results

Search: id:A086858

Displaying 1-1 of 1 results found.

page 1

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, 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; listen)

	OFFSET	`1,4`
	COMMENT	`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: A073458 A105519 A111891 this_sequence A111892 A108248 A087104` `Adjacent sequences: A086855 A086856 A086857 this_sequence A086859 A086860 A086861`
	KEYWORD	`easy,nonn`
	AUTHOR	`Christopher M. Tomaszewski (cmt1288(AT)comcast.net), Sep 16 2003`

page 1

Search completed in 0.002 seconds

Last modified September 7 15:23 EDT 2008. Contains 143483 sequences.

AT&T Labs Research