This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263489 Triangle read by rows: T(n,k) (n>=2, 1<=k<=n!) is the number of permutations of n whose inversion arrangement contains k regions. 0
 1, 1, 1, 2, 0, 2, 0, 1, 1, 3, 0, 5, 0, 2, 0, 4, 0, 0, 0, 4, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0, 1, 1, 4, 0, 9, 0, 3, 0, 12, 0, 0, 0, 10, 0, 2, 0, 8, 0, 6, 0, 0, 0, 0, 0, 14, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 4, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,4 COMMENTS Row sums give A000142, n >= 2. LINKS FindStat - Combinatorial Statistic Finder, The number of regions of inversion arrangement of a permutation. EXAMPLE Triangle begins: 1,1, 1,2,0,2,0,1, 1,3,0,5,0,2,0,4,0,0,0,4,0,1,0,0,0,3,0,0,0,0,0,1, ... CROSSREFS Cf. A000142. Sequence in context: A193779 A279048 A263485 * A238660 A174793 A245718 Adjacent sequences:  A263486 A263487 A263488 * A263490 A263491 A263492 KEYWORD nonn,tabf AUTHOR Christian Stump, Oct 19 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.

Last modified December 6 09:37 EST 2019. Contains 329800 sequences. (Running on oeis4.)