35812

Appears in sequences

• Cupolar numbers: a(n) = (n+1)*(5*n^2 + 7*n + 3)/3.at n=27A096000
• Number of n X 4 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 n X 4 array.at n=5A218893
• T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 nXk array.at n=41A218897
• Number of 6Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 6Xn array.at n=3A218902
• Numbers k such that 3^k + 26 is prime.at n=33A219044
• Number of binary strings of length n avoiding "squares" (that is, repeated blocks of the form xx) with |x| > 2.at n=18A229614
• Number of length-n 0..3 arrays with no repeated value differing from the previous repeated value by other than one.at n=7A269532
• T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than one.at n=52A269537
• T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by one or less.at n=52A269606
• Number of Dyck paths of semilength n such that every peak at level y > 1 is preceded by (at least) one peak at level y-1 and is followed by (at least) one peak at level y-1.at n=15A287776
• The number of edges inside a heptagon formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts.at n=3A333112
• Table read by antidiagonals: Place k equally spaced points 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 the number of edges in the resulting planar graph.at n=32A367324
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A381572.at n=60A381571