The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A322093 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A322093

Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k with no element equal to another within a distance of 1.
(history; published version)

#34 by Michel Marcus at Tue Feb 06 00:47:32 EST 2024

STATUS

reviewed

approved

#33 by Joerg Arndt at Tue Feb 06 00:42:25 EST 2024

STATUS

proposed

reviewed

#32 by Andrew Howroyd at Mon Feb 05 23:03:32 EST 2024

STATUS

editing

proposed

#31 by Andrew Howroyd at Sat Feb 03 21:42:11 EST 2024

PROG

(PARI)

q(n, x) = sum(i=1, n, (-1)^(n-i) * binomial(n-1, n-i) * x^i/i!)

T(n, k) = subst(serlaplace(q(n, x)^k), x, 1) \\ Andrew Howroyd, Feb 03 2024

STATUS

approved

editing

#30 by Bruno Berselli at Wed Nov 28 08:48:51 EST 2018

STATUS

proposed

approved

#29 by Seiichi Manyama at Wed Nov 28 08:09:57 EST 2018

STATUS

editing

proposed

#28 by Seiichi Manyama at Wed Nov 28 08:09:12 EST 2018

CROSSREFS

Rows n=1..5 10 give A000142, A114938, A193638, A321633, A322126, A321382, A322095, A322096, A322145, A322146.

STATUS

approved

editing

#27 by Peter Luschny at Wed Nov 28 03:29:14 EST 2018

STATUS

reviewed

approved

#26 by Michel Marcus at Wed Nov 28 02:10:36 EST 2018

STATUS

proposed

reviewed

#25 by Seiichi Manyama at Tue Nov 27 17:11:15 EST 2018

STATUS

editing

proposed