30634

Appears in sequences

• No-3-in-line problem on n X n grid: total number of ways of placing 2n points on n X n grid so no 3 are in a line. No symmetries are taken into account.at n=14A000755
• Sum of n-th antidiagonal of A082191.at n=36A082195
• Diagonal sums of the Riordan array A116382.at n=16A116384
• Number of n-bead necklaces labeled with numbers -3..3 not allowing reversal, with sum zero and three times sum of squares <= n*(3)*(3+1).at n=7A208809
• T(n,k)=Number of n-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero and three times sum of squares <= n*k*(k+1).at n=52A208814
• G.f.: Sum_{n>=0} x^n * Product_{k=1..n} (1 - x^(n+k))/(1 - x^k).at n=42A260894
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 611", based on the 5-celled von Neumann neighborhood.at n=29A273214
• Binomial(n,4) - A290447(n).at n=44A290461
• a(n) = A006561(n) - A290447(n).at n=44A290465
• a(n) = Sum_{k=0..floor(n/3)} binomial(2*n+1,n-3*k).at n=8A371873