|
| |
|
|
A000240
|
|
Rencontres numbers: permutations with exactly one fixed point.
(Formerly M2763 N1111)
|
|
14
| |
|
|
1, 0, 3, 8, 45, 264, 1855, 14832, 133497, 1334960, 14684571, 176214840, 2290792933, 32071101048, 481066515735, 7697064251744, 130850092279665, 2355301661033952, 44750731559645107, 895014631192902120, 18795307255050944541, 413496759611120779880
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| Contribution from Emeric Deutsch (deutsch(AT)duke.poly.edu), Sep 06 2010: (Start)
a(n) is also the number of permutations of [n] having no circular succession. A circular succession in a permutation p of [n] is either a pair p(i), p(i+1), where p(i+1)=p(i)+1 or the pair p(n), p(1) if p(1)=p(n)+1. a(4)=8 because we have 1324, 1432, 4132, 2143, 2413, 3214, 3241, and 4321.
a(n)=A180188(n,0).
(End)
|
|
|
REFERENCES
| S. K. Das and N. Deo, Rencontres graphs: a family of bipartite graphs, Fib. Quart., Vol. 25, No. 3, August 1987, 250-262.
I. Kaplansky, Symbolic solution of certain problems in permutations, Bull. Amer. Math. Soc., 50 (1944), 906-914.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 65.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
S. M. Tanny, Permutations and successions, J. Combinatorial Theory, Series A, 21 (1976), 196-202.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..100
|
|
|
FORMULA
| E.g.f. = exp(-x)*(1+x^3)/((1-x)(1-x^2)). a(n)=sum((-1)^k*n!/k!, k=0..n-1).
E.g.f. = x*A(x) where A(x) is the e.g.f. for A000166. - Geoffrey Critzer, Jan 14 2012
a(n) = n*a(n-1)-(-1)^n*n = A000166(n)-(-1)^n = n*A000166(n-1) = A000387(n+1)*2/(n+1) = A000449(n+2)*6/((n+1)*(n+2)).
a(n)=n*floor(((n-1)!+1)/e), n>1. [From Gary Detlefs, Jul 13 2010]
lim_{n->infinity} n!/a(n) = e = 2.71828...
|
|
|
EXAMPLE
| a(3)=3 because the permutations of (1,2,3) with one fixed point are (1,3,2), (3,2,1) and (2,1,3)
|
|
|
MAPLE
| a:=n->sum(n!*sum((-1)^k/k!, j=0..n), k=0..n): seq(a(n), n=0..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 17 2007
restart: G(x):=exp(-x)/(1-x)*x: f[0]:=G(x): for n from 1 to 26 do f[n]:=diff(f[n-1], x) od: x:=0: seq(f[n], n=1..22); # [From Zerinvary Lajos, Apr 03 2009]
|
|
|
MATHEMATICA
| Table[Subfactorial[n]*(n + 1), {n, 0, 21}] [From Zerinvary Lajos, Jul 10 2009]
|
|
|
CROSSREFS
| Cf. A008290, A000166, A000387, etc.
A diagonal of A008291.
Cf. A180188.
Sequence in context: A074435 A039647 A071533 * A132103 A180508 A040018
Adjacent sequences: A000237 A000238 A000239 * A000241 A000242 A000243
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
| |
|
|
