56520

Appears in sequences

• Number of partitions satisfying (cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=46A036801
• Numbers k such that the k-th triangular number contains each of the 10 decimal digits exactly once.at n=5A115939
• a(n) = 12*a(n-1)-30*a(n-2) for n > 1; a(0) = 1, a(1) = 10.at n=5A164552
• The number of different lattice paths from (0,0) to (2n,0) using steps of S={(i,i) or (i,-i): i=1,2,...,n} with j flaws(j=1,2,...,n-1), where the j flaws is the sum of lengths of down steps below the x-axis. (For down steps that are partly above and partly below the x-axis we just count the part below the x-axis.) This number is independent of the number of flaws.at n=7A210474
• Triangle read by rows: T(n, k) is the number of ways to select k disjoint point triples from an n X n X n triangular point grid, each point triple forming a 2 X 2 X 2 triangle.at n=38A289222
• Number of ways to select 4 disjoint point triples from an n X n X n triangular point grid, each point triple forming a 2 X 2 X 2 triangle.at n=4A289225
• Number of nX4 0..1 arrays with every element equal to 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=14A298959