24794

Appears in sequences

• a(n) = (9*n+1)*(9*n+8).at n=17A001534
• a(n) is the number of Dyck paths of semilength n+6 having its first peak at height n+1.at n=13A005557
• Number of Hamiltonian cycles in P_4 X P_n.at n=12A006864
• Maximization of sums of cubes of integer differences (b_[ i ]-i)^3 over permutations {b_[ i ], for i-1,2,...,n} on first n integers.at n=28A049031
• Number of symmetric types of (3,2n)-hypergraphs under action of complementing group C(3,2).at n=42A055780
• A diagonal of A008296.at n=20A059302
• A number triangle of lattice walks.at n=49A107842
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross downwards the x-axis k times. (A Grand Dyck path of semilength n is a path in the half-plane x>=0, starting at (0,0), ending at (2n,0) and consisting of steps u=(1,1) and d=(1,-1)).at n=39A118919
• Half the number of n X 3 binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors.at n=8A183399
• Number of (7+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=9A250775
• Number of North-East lattice paths from (0,0) to (n,n) that cross the diagonal y = x horizontally exactly three times.at n=5A268446
• a(n) = p*(p - 1)*(13*p - 5)/6, where p = prime(n).at n=8A273221
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 613", based on the 5-celled von Neumann neighborhood.at n=27A273243
• Numbers n such that n and n+1 both have 24 divisors.at n=4A274362
• Number of connected induced (non-null) subgraphs of the helm graph with 2n+1 nodes.at n=8A286184
• Number of abundant numbers < 10^n.at n=4A302992
• a(n) is the total number of down steps before the first up step in all 3_2-Dyck paths of length 4*n. A 3_2-Dyck path is a lattice path with steps (1, 3), (1, -1) that starts and ends at y = 0 and stays above the line y = -2.at n=6A334785
• Numbers k such that k and k+1 both have the prime signature (2,1,1,1) (A189982).at n=2A336658
• a(n) = Sum_{k=0..floor(n/2)} n^k * Stirling2(n,2*k).at n=7A357682
• Number of unordered pairs of self-avoiding paths whose sets of nodes are disjoint subsets of a set of n points on a circle; one-node paths are not allowed.at n=7A360716