login

Revisions by Taras Goy

(See also Taras Goy's wiki page)

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = 5*binomial(2n, n-2)/(n+3).
(history; published version)
#147 by Taras Goy at Mon Jul 15 14:59:20 EDT 2024
STATUS

editing

proposed

#146 by Taras Goy at Mon Jul 15 14:59:17 EDT 2024
FORMULA

a(n) = 5*(2*n)!*(n-1)!/((2n2*n-4)!*(n+3)!)*A000108(n-2). - Taras Goy, Jul 15 2024

#144 by Taras Goy at Mon Jul 15 09:47:29 EDT 2024
STATUS

editing

proposed

Discussion
Mon Jul 15
10:28
Charles R Greathouse IV: Pick either 2*n or 2n and use it in both places, please.
#143 by Taras Goy at Mon Jul 15 09:45:48 EDT 2024
FORMULA

a(n) = 5*(2*n)!*(n-1)!/((2n-4)!*(n+3)!)*A000108(n-2). - Taras Goy, Jul 15 2024

STATUS

approved

editing

Number of permutations of [n+1] with exactly 1 increasing subsequence of length 3.
(history; published version)
#139 by Taras Goy at Mon Jul 15 05:36:52 EDT 2024
STATUS

editing

proposed

#138 by Taras Goy at Mon Jul 15 05:15:12 EDT 2024
FORMULA

a(n) = A000108(n+3) - 4*A000108(n+2) + 3*A000108(n+1). _- _Taras Goy_, Jul 15 2024

Discussion
Mon Jul 15
05:29
Stefano Spezia: Your formula and signature is ok now, please propose when you are ready, and it will be reviewed
#136 by Taras Goy at Mon Jul 15 03:46:23 EDT 2024
STATUS

editing

proposed

Discussion
Mon Jul 15
04:56
Michel Marcus: Please fix signature (see other signatures above)
#135 by Taras Goy at Mon Jul 15 03:46:03 EDT 2024
FORMULA

a(n) = A000108(n+3) - 4*A000108(n+2) + 3*A000108(n+1). Taras Goy, Jul 15 2024

STATUS

approved

editing

#132 by Taras Goy at Sun Jul 14 17:18:16 EDT 2024
STATUS

editing

proposed

Discussion
Sun Jul 14
17:22
Alois P. Heinz: gives 5, 20, 75, 275, 1001, 3640, 13260, 48450, 177650, 653752, 2414425, 
which is NOT this sequence ...
#131 by Taras Goy at Sun Jul 14 17:18:09 EDT 2024
FORMULA

a(n) = A000108(n+5) - 3*A000108(n+4) + A000108(n+3). Taras Goy, Jul 14 2024

STATUS

approved

editing