27760

Appears in sequences

• Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5).at n=38A039842
• Numbers n such that A078142(n) = A078142(n+1) = A078142(n+2), where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.at n=12A073938
• Structured heptagonal anti-diamond numbers (vertex structure 7).at n=19A100186
• Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x).at n=37A110107
• Numbers k such that k and k^2 use only the digits 0, 1, 2, 6 and 7.at n=34A136828
• a(n) = Sum_{k=0..n} k*A000009(k).at n=27A270105
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 307", based on the 5-celled von Neumann neighborhood.at n=34A271166
• a(n) is the total number of points (both boundary and interior points) in the n-th figure shown in A255011 (meaning the figure with 4n points on the perimeter), where the interior points are counted with multiplicity.at n=7A334698
• G.f. satisfies A(x) = 1 + 2*x + 2*x^3*A(x)^3.at n=12A367074
• Table read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives number of vertices in the resulting planar graph.at n=37A367183