28028

Appears in sequences

• Number of diagonal dissections of a convex n-gon into n-5 regions.at n=5A002056
• a(n) = (n+1)*binomial(n+1,5).at n=9A027765
• a(n) = (n+1)*binomial(n+1, 9).at n=5A027769
• Number of diagonal dissections of an n-gon into 6 regions.at n=4A033278
• Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.at n=41A033282
• a(n) = f(n,4) where f is given in A034261.at n=11A034264
• Numerators of continued fraction convergents to sqrt(246).at n=7A041460
• Partial sums of A002419.at n=13A051843
• Expansion of g.f.: (1+4*x)/(1-x)^7.at n=10A051946
• Number of symmetric nonnegative integer 8 X 8 matrices with sum of elements equal to 4*n, under action of dihedral group D_4.at n=13A054498
• Numbers whose name in American English is a word-palindrome, reading the same forward and backward.at n=36A081365
• Triangle read by rows, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x)^2 + xy*f(x,y)^2.at n=49A086614
• Triangle obtained by adding a leading diagonal 1,0,0,0,... to A033282.at n=51A086810
• Numbers n such that 2*n*k(n) is rational but not an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there); numbers belonging to A086378 but not to A088900.at n=20A087414
• Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n, having k ascents of length at least 2 (1 <= k <= floor(n/2), n >= 2).at n=47A114593
• Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).at n=39A126216
• Triangle T(n,k), 0 <= k <= n, read by rows, given by [1,1,1,1,1,1,1,...] DELTA [0,1,0,1,0,1,0,1,0,...] where DELTA is the operator defined in A084938.at n=48A133336
• Cubefree part of n!.at n=14A145642
• Cubefree part of n!!.at n=29A145643
• a(n) = 1001*n.at n=27A153814