A135813 -id:A135813 - cp's OEIS frontend

A135812 Number of coincidence-free length n lists of 6-tuples with all numbers 1..n in tuple position k, for k=1..6.

1, 0, 63, 46466, 190916733, 2985028951044, 139296156465612475, 16389185827288545027462, 4296451238117542245438597369, 2283341354940565366869098996941832, 2283357189984839137684466072214718029111, 4045121880919515919070740138437150042543712650

Offset: 0

Wolfdieter Lang, Jan 21 2008

a(n) enumerates (ordered) lists of n 6-tuples such that every number from 1 to n appears once at each of the six tuple positions and the j-th list member is not the tuple (j,j,j,j,j,j), for every j=1..n. Called coincidence-free 6-tuple lists of length n. See the Charalambides reference for this combinatorial interpretation.

			6-tuple combinatorics: a(1)=0 because the only list of 6-tuples composed of 1 is [(1,1,1,1,1,1)] and this is a coincidence for j=1.
6-tuple combinatorics: from the 2^6=64 possible 6-tuples of numbers 1 and 2 all except (1,1,1,1,1,1) appear as first members of the length 2 lists. The second members are the 6-tuples obtained by interchanging 1 and 2 in the first member. E.g. one of the a(2) = 2^6-1 = 63 lists is [(1,1,1,1,1,2),(2,2,2,2,2,1)]. The list [(1,1,1,1,1,1),(2,2,2,2,2,2)] does not qualify because it has in fact two coincidences, those for j=1 and j=2.

Ch. A. Charalambides, Enumerative Combinatorics, Chapman & Hall/CRC, Boca Raton, Florida, 2002, p. 187, Exercise 13.(a), for r=6.

G. C. Greubel, Table of n, a(n) for n = 0..100

Cf. A135811 (coincidence-free 5-tuples). A135813 (coincidence-free 7-tuples).

Table[Sum[(-1)^(n - k)*Binomial[n, k]*(k!)^6, {k, 0, n}], {n,0,25}] (* G. C. Greubel, Nov 23 2016 *)

a(n) = Sum_{j=0..n} ((-1)^(n-j))*binomial(n,j)*(j!)^6. See the Charalambides reference a(n)=B_{n,6}.

A135814 Triangle of numbers of coincidence-free length n-m lists of m-tuples with all numbers 1,...,n-m in tuple position k, for k=1..m.

Original entry on oeis.org

1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 2, 3, 0, 1, 0, 9, 26, 7, 0, 1, 0, 44, 453, 194, 15, 0, 1, 0, 265, 11844, 13005, 1250, 31, 0, 1, 0, 1854, 439975, 1660964, 326685, 7682, 63, 0, 1, 0, 14833, 22056222, 363083155, 205713924, 7931709, 46466, 127, 0, 1, 0, 133496

Offset: 0

Wolfdieter Lang, Jan 21 2008, Feb 22 2008, May 21 2008

The column sequences (without leading zeros) give A000007, A000166 (subfactorials), A089041, A135809 - A135813, for m=0..7.

a(n,m), n >= m, enumerates (ordered) length n-m lists of m-tuples such that every number from 1 to n-m appears once at each of the n-m tuple positions and the j-th list member is not the tuple (j,j,...,j) (m times j), for every j=1,...,n-m. Called coincidence-free m-tuple lists of length n-m. See the Charalambides reference for this combinatorial interpretation.

			[1]; [0,1]; [0,0,1]; [0,1,0,1]; [,0,2,3,0,1]; [0,9,26,7,0,1]; ...
The a(5,3)=7 lists of length 5-3=2 with coincidence-free 3-tuples are [(1,1,2),(2,2,1)], [(1,2,1),(2,1,2)], [(2,1,1),(1,2,2)], [(1,2,2),(2,1,1)], [(2,1,2),(1,2,1)], [(2,2,1),(1,1,2)] and [(2,2,2),(1,1,1)]. The list [(1,1,1),(2,2,2)] is not coincidence-free because (1,1,1) appears at position 1 and also because (2,2,2) appears at position 2.

Ch. A. Charalambides, Enumerative Combinatorics, Chapman & Hall/CRC, Boca Raton, Florida, 2002, p. 187, Exercise 13.(a).

W. Lang, First 10 rows and more.

a(n,m) = Sum_{j=0..n-m} (-1)^(n-m-j)*binomial(n-m,j)*(j!)^m, n >= m >= 0, otherwise 0.

cp's OEIS Frontend

A135812 Number of coincidence-free length n lists of 6-tuples with all numbers 1..n in tuple position k, for k=1..6.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula