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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A211371 The number of indecomposable n-permutations that have only cycles of length 3 or less. 0
0, 1, 1, 3, 7, 29, 131, 585, 3083, 17089, 97987, 607977, 3926731, 26344001, 185908739, 1358432937, 10279616891, 80819893393, 655374770131, 5482528852761, 47329769940331, 420061520283617, 3832533793409027, 35926633641149865, 345280194806563931 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..24.

FORMULA

G.f.: 1-1/A(x) where A(x) is the o.g.f. for A057693.

EXAMPLE

a(4) = 7 because we have: 2431, 3241, 3412, 4132, 4213, 4231, 4321.

MATHEMATICA

nn = 20; a = x + x^2/2 + x^3/3; b = Total[Range[0, nn]! CoefficientList[Series[Exp[a], {x, 0, nn}], x]* x^Range[0, nn]]; CoefficientList[Series[1 - 1/b, {x, 0, nn}], x]

CROSSREFS

Cf. A057693, A003319, A140456.

Sequence in context: A217576 A173280 A141477 * A302157 A294383 A082096

Adjacent sequences:  A211368 A211369 A211370 * A211372 A211373 A211374

KEYWORD

nonn

AUTHOR

Geoffrey Critzer, May 11 2012

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 March 30 19:43 EDT 2020. Contains 333127 sequences. (Running on oeis4.)