|
|
|
|
|
|
|
|
|
#13 by Bruno Berselli at Wed Aug 27 05:18:27 EDT 2014
|
|
|
|
|
|
|
|
#12 by Joerg Arndt at Wed Aug 27 05:16:22 EDT 2014
|
|
|
|
|
|
|
|
#11 by Joerg Arndt at Wed Aug 27 05:16:18 EDT 2014
|
|
|
|
|
|
|
|
#10 by Joerg Arndt at Wed Aug 27 05:14:27 EDT 2014
|
|
| COMMENTS
|
It appears that T(n,k) = # ) is the number of indecomposable permutations p of [n+2] for which p(k+2) = 1. For example, T(2,1) = 4 counts 2413, 3412, 4213, 4312. _. - _David Callan_, Aug 27 2014
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
Discussion
|
| Wed Aug 27
| 05:16
| Joerg Arndt: Done.
|
|
|
|
|
|
|
#9 by Michel Marcus at Wed Aug 27 03:07:48 EDT 2014
|
|
|
|
|
|
|
|
#8 by Michel Marcus at Wed Aug 27 03:05:50 EDT 2014
|
|
| COMMENTS
|
It appears that T(n,k) = # indecomposable permutations p of [n+2] for which p(k+2) = 1. For example, T(2,1.) = 4 counts 2413, 3412, 4213, 4312. _David Callan_, Aug 27 2014
For example, T(2,1) = 4 counts 2413, 3412, 4213, 4312. _David Callan, Aug 27 2014_
|
|
| CROSSREFS
|
Cf. A193091, A130296, A193093.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
Discussion
|
| Wed Aug 27
| 03:07
| Michel Marcus: I think it is a single comment, so joined them.
Maybe replace = # by is the number of ?
|
|
|
|
|
|
|
#7 by David Callan at Wed Aug 27 03:01:59 EDT 2014
|
|
|
|
|
|
|
|
#6 by David Callan at Wed Aug 27 03:01:37 EDT 2014
|
|
| COMMENTS
|
It appears that T(n,k) = # indecomposable permutations p of [n+2] for which p(k+2) = 1.
For example, T(2,1) = 4 counts 2413, 3412, 4213, 4312. _David Callan, Aug 27 2014_
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#5 by Russ Cox at Fri Mar 30 18:57:38 EDT 2012
|
|
| AUTHOR
|
_Clark Kimberling (ck6(AT)evansville.edu), _, Jul 30 2011
|
|
|
|
|
Discussion
|
| Fri Mar 30
| 18:57
| OEIS Server: https://oeis.org/edit/global/285
|
|
|
|
|
|
|
#4 by T. D. Noe at Sun Jul 31 14:30:02 EDT 2011
|
|
|
|
|
|
|
