login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082426 a(1)=1, a(n)=n*(a(n-1)+a(n-2)+...+a(2)+a(1)) + 2. 0
1, 3, 10, 49, 301, 2161, 17641, 161281, 1632961, 18144001, 219542401, 2874009601, 40475635201, 610248038401, 9807557760001, 167382319104001, 3023343138816001, 57621363351552001, 1155628453883904001 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Concatenate all the permutations of 1..n in lexicographical order. a(n) is the number of ascending runs. [David Scambler, May 26 2011]

FORMULA

for n>=2 a(n) = ceiling(n*(2*e-9/2)*n!)

CROSSREFS

Cf. A074143.

Sequence in context: A005921 A193281 A143921 * A054381 A102088 A088142

Adjacent sequences:  A082423 A082424 A082425 * A082427 A082428 A082429

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 24 2003

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 14 20:38 EST 2012. Contains 205663 sequences.