Pyramid P(n, t, d) read by planes and rows, for 0 <= t+d <= n: number of ways n triples can sit in a row so that exactly t triples are together and exactly d triples are separated into a couple and a loner.
A192990
Pyramid P(n, t, d) read by planes and rows, for 0 <= t+d <= n: number of ways n triples can sit in a row so that exactly t triples are together and exactly d triples are separated into a couple and a loner.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =6a(4) =72a(5) =144a(6) =288a(7) =0a(8) =144a(9) =72a(10) =37584a(11) =95904a(12) =98496a(13) =51840a(14) =11664a(15) =25920a(16) =31104a(17) =1296a(18) =7776a(19) =1296a(20) =53529984a(21) =127899648a(22) =130761216a(23) =69921792a(24) =17915904a(25) =11321856a(26) =26002944a(27) =23887872a(28) =10202112a(29) =1430784
External references
- oeis: A192990