login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076630 a(n) is the smallest number such that product of first n terms is strictly greater than n-th power of a(n-1) starting with a(1)=1. 0
1, 2, 5, 63, 1575297, 15398261127422599513389116979 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Next term is 1.343...*10^160. Of the n^n ways of selecting n terms from {a(1),a(2),...,a(n)}, n!*Sum_k{1<=k<=n}(k-1)^k/k!=A076483(n) ways have a product strictly less than a(1)*a(2)*...*a(n) and this is possibly the smallest sequence with that property. If the definition had been: a(n) is the smallest number such that sum of first n terms is greater than n times a(n-1) starting with a(1)=1, then the resulting sequence would have been A003422.
LINKS
FORMULA
a(n) = 1 + floor[a(n-1)^n / Product_i{0<i<n}a(i)].
EXAMPLE
a(4)=1+floor[5^4/(1*2*5)]=1+floor[62.5]=63.
CROSSREFS
Cf. A076483.
Sequence in context: A012978 A012949 A027667 * A270389 A350956 A086560
KEYWORD
nonn
AUTHOR
Henry Bottomley, Oct 22 2002
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:39 EDT 2024. Contains 371963 sequences. (Running on oeis4.)