This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122823 Triangle read by rows: T(n,k) = count of increasing runs in two concatenated k-permutations of [n]. 1
 2, 7, 11, 15, 96, 132, 26, 378, 2088, 2664, 40, 1040, 12960, 66240, 80640, 57, 2325, 51600, 594000, 2894400, 3412800, 77, 4536, 157500, 3225600, 35380800, 166924800, 192326400, 100, 8036, 402192, 12877200, 251193600, 2667168000, 12294374400 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA T(n,k) = ((k+1) - (n-1)/2n) * Permute(n,k)^2 EXAMPLE Triangle begins: 2 7 11 15 96 132 Take the 2-permutations of [2] namely 12 and 21 and form all possible strings that are concatenations of two of these permutations. These are 1212,1221,2112,2121 with 2,3,3,3 increasing runs respectively. T(2,2) = 2+3+3+3 = 11. CROSSREFS Column 1 = T(n, 1) = A005449, Second pentagonal numbers: n*(3n+1)/2. Sequence in context: A001960 A174008 A140491 * A063289 A287726 A190518 Adjacent sequences:  A122820 A122821 A122822 * A122824 A122825 A122826 KEYWORD easy,nonn,tabl AUTHOR David Scambler, Oct 29 2006 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 October 13 20:38 EDT 2019. Contains 327981 sequences. (Running on oeis4.)