|
|
A047921
|
|
Triangle of numbers a(n,k) = number of permutations on n letters containing k 3-sequences (n >= 0, 0<=k<=max(0,n-2)).
|
|
4
|
|
|
1, 1, 2, 5, 1, 21, 2, 1, 106, 11, 2, 1, 643, 62, 12, 2, 1, 4547, 406, 71, 13, 2, 1, 36696, 3046, 481, 80, 14, 2, 1, 332769, 25737, 3708, 559, 89, 15, 2, 1, 3349507, 242094, 32028, 4414, 640, 98, 16, 2, 1, 37054436, 2510733, 306723, 38893, 5164, 724, 107, 17, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
Riordan gives a recurrence.
|
|
EXAMPLE
|
Triangle begins:
1;
1;
2;
5, 1;
21, 2, 1;
106, 11, 2, 1;
643, 62, 12, 2, 1;
4547, 406, 71, 13, 2, 1;
36696, 3046, 481, 80, 14, 2, 1;
332769, 25737, 3708, 559, 89, 15, 2, 1;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf,nice,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|