28652

Appears in sequences

• a(n) = A027113(n, 2n-6).at n=9A027124
• Number of subsets A of {1,2,...,n} with |A+A| = |A-A|.at n=17A118544
• a(n) = Fibonacci(n) - 5.at n=18A167616
• Number of 2n X 3 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to exactly one horizontal or vertical neighbor.at n=5A199259
• Draw a square and follow these steps: Take a square and place at its edges isosceles right triangles with the edge as hypotenuse. Draw a square at every new edge of the triangles. Repeat for all the new squares of the same size. New figures are only placed on empty space. The structure is symmetric about the first square. The sequence gives the numbers of squares of equal size in successive rings around the center.at n=21A265207
• Number of nX4 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=9A281711
• Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient.at n=52A308737
• Number of partitions of positive integer n such that all parts are less than the square root of n.at n=54A316353
• Number of winning positions for the next player (a, b, c) where 1 <= a, b, c <= n in "Divisor Nim" (see comments).at n=33A383226