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!)
A259704 Triangle read by rows: T(n,k) = number of overlaps formed by element 1 in the set of permutations of n elements, where the element n does not occupy the k-th place after 1. 1
0, 0, 0, 1, 0, 1, 2, 2, 2, 2, 20, 14, 12, 14, 20, 80, 80, 80, 80, 80, 80, 840, 720, 648, 624, 648, 720, 840 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

2,7

REFERENCES

A. Sade, Sur les Chevauchements des Permutations, published by the author, Marseille, 1949.

LINKS

Table of n, a(n) for n=2..29.

Albert Sade, Sur les Chevauchements des Permutations, published by the author, Marseille, 1949. [Annotated scanned copy]

EXAMPLE

Triangle begins:

0,

0,0,

1,0,1,

2,2,2,2,

20,14,12,14,20,

80,80,80,80,80,80,

840,720,648,624,648,720,840,

...

CROSSREFS

Row sums are A259705.

Sequence in context: A029643 A100687 A067096 * A249779 A167394 A029627

Adjacent sequences:  A259701 A259702 A259703 * A259705 A259706 A259707

KEYWORD

nonn,tabl,more

AUTHOR

N. J. A. Sloane, Jul 05 2015

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 October 23 08:40 EDT 2021. Contains 348211 sequences. (Running on oeis4.)