Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082573
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082573 a(1)=1, a(n)=ceiling(n*(a(n-1)+3/a(n-1))). +0
1
1, 8, 26, 105, 526, 3157, 22100, 176801, 1591210, 15912101, 175033112, 2100397345, 27305165486, 382272316805, 5734084752076, 91745356033217, 1559671052564690, 28074078946164421, 533407499977124000, 10668149999542480001 (list; graph; listen)
OFFSET

0,2

COMMENT

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))

FORMULA

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

CROSSREFS

Sequence in context: A051669 A027004 A140788 this_sequence A112645 A089064 A000810

Adjacent sequences: A082570 A082571 A082572 this_sequence A082574 A082575 A082576

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 06 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research