login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082573 a(1)=1, a(n)=ceiling(n*(a(n-1)+3/a(n-1))). 0
1, 8, 26, 105, 526, 3157, 22100, 176801, 1591210, 15912101, 175033112, 2100397345, 27305165486, 382272316805, 5734084752076, 91745356033217, 1559671052564690, 28074078946164421, 533407499977124000, 10668149999542480001 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

More generally if m is an integer >=3 and a(1)=1, a(n)=ceiling(n*(a(n-1)+m/a(n-1))) there is a closed formula for a(n) namely : a(n)=floor(n!*(e+m-4/3))

LINKS

Table of n, a(n) for n=1..20.

FORMULA

a(n)=floor(n!*(exp(1)+5/3))

MATHEMATICA

nxt[{n_, a_}]:={n+1, Ceiling[(n+1)(a+3/a)]}; Transpose[NestList[nxt, {1, 1}, 20]][[2]] (* Harvey P. Dale, Sep 12 2013 *)

CROSSREFS

Sequence in context: A173365 A261971 A140788 * A112645 A220713 A260962

Adjacent sequences:  A082570 A082571 A082572 * A082574 A082575 A082576

KEYWORD

nonn

AUTHOR

Benoit Cloitre, May 06 2003

EXTENSIONS

Offset changed by Harvey P. Dale, Sep 12 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 08:41 EST 2021. Contains 349627 sequences. (Running on oeis4.)