login
The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A274997 Number of permutations of [n] having exactly one doubledescent. 2
0, 0, 0, 1, 6, 41, 274, 2040, 16346, 143571, 1365354, 14056287, 155638724, 1847352720, 23400880036, 315270938501, 4502081195166, 67941159822229, 1080528172834710, 18065046986905320, 316769071197428286, 5813469963339136855, 111449225620923739458 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..463

FORMULA

a(n) ~ c * 3^(3*n/2) * n^(n+3/2) / (exp(n) * 2^n * Pi^n), where c = 0.827206526063705458546024... . - Vaclav Kotesovec, Dec 11 2016

CROSSREFS

Column k=1 of A162975.

Sequence in context: A194781 A323969 A252980 * A015551 A291018 A227214

Adjacent sequences: A274994 A274995 A274996 * A274998 A274999 A275000

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Nov 29 2016

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 December 1 05:02 EST 2022. Contains 358454 sequences. (Running on oeis4.)