login
This site is supported by donations 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; 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.

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: A134590 A012978 A012949 * A086560 A133004 A175169

Adjacent sequences:  A076627 A076628 A076629 * A076631 A076632 A076633

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Oct 22 2002

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 17 19:13 EST 2012. Contains 206085 sequences.