111360

Appears in sequences

• Let A(n) = {1,2,3,...n}. Let B(r) and C(n-r) be two subsets of A(n) having r and n-r elements respectively, such that B(r) U C(n-r) = A(n) and B and C are disjoint; then a(n) = sum of the products of all combination sums of elements of B and C for r =1 to n-1.at n=8A067057
• Duplicate of A067057.at n=8A084399
• Array read by antidiagonals: T(m,n) = number of (undirected) paths in the grid graph P_m X P_n.at n=38A288518
• Array read by antidiagonals: T(m,n) = number of (undirected) paths in the grid graph P_m X P_n.at n=42A288518
• Number of (undirected) paths in the grid graph P_3 X P_n.at n=6A288527
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 670", based on the 5-celled von Neumann neighborhood.at n=16A290160
• Number of length-n ternary words containing no even palindromes of length > 0 and no odd palindromes of length > 3.at n=26A330132
• a(n) = A351477(n) * FC where F is the Fermat point of a primitive integer-sided triangle ABC with A < B < C < 2*Pi/3 and FA + FB + FC = A336329(n).at n=12A351803
• Number of (undirected) paths in the grid graph P_7 X P_n.at n=2A358803
• E.g.f. A(x) satisfies A(x) = A(x^2)^(1/2) * exp(2*x) with A(0)=1.at n=8A374346