23604

Appears in sequences

• a(n) = round(n*phi^14), where phi is the golden ratio, A001622.at n=28A004949
• a(n) = ceiling(n*phi^14), where phi is the golden ratio, A001622.at n=28A004969
• Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges.at n=48A054548
• Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having length of first descent equal to k (1<=k<=n; n>=1). A hill in a Dyck path is a peak at level 1.at n=67A118972
• Number of hill-free Dyck paths of semilength n+2 and having length of first descent equal to 2 (a hill in a Dyck path is a peak at level 1).at n=10A118973
• Least number k having n representations as the sum of the minimal number of cubes A002376(k).at n=22A163490
• Number of (n+2) X 4 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=10A202455
• T(n,k) = count of degree k monomials in the power sum symmetric polynomials p(mu,k) summed over all partitions mu of n.at n=24A209664
• Number of distinct sums <= 1 of distinct reciprocals of integers <= n.at n=19A212607
• Number of nX4 0..2 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 3.at n=15A240035
• Number of partitions of n into 4 sorts of parts.at n=7A246936
• Numbers k such that sigma(phi(k)) - phi(k) = phi(sigma(k)), where phi(k) is the Euler totient function of k and sigma(k) is the sum of the divisors of k.at n=8A271633
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 437", based on the 5-celled von Neumann neighborhood.at n=31A272155
• Triangle T(m, n) = the number of point-labeled graphs with n points and m edges, no points isolated. By rows, n >= 0, ceiling(n/2) <= m <= binomial(n,2).at n=32A276639
• a(n) = 27*n^2/2 + 45*n/2 - 12 (n>=1).at n=40A304375
• Triangle read by rows: T(n,k) is the number of chiral pairs of colorings of the facets of a regular n-dimensional orthotope using exactly k colors. Row n has 2n columns.at n=36A325010
• Triangle read by rows: T(n,m) (n >= m >= 1) = number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares.at n=42A331452
• Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n*k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph.at n=39A367304