121014

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306.at n=45A025110
• Triangle T(n,k) (0 <= k <= n) read by rows: top entry is 1, all other rows begin with 0; typical entry is sum of entry to left plus sum of all entries above it in the triangle.at n=43A059226
• A diagonal of triangle defined in A059226.at n=7A059229
• Sum of the Strahler numbers of all full binary trees with n internal vertices.at n=10A127152
• G.f.: (t^5 + 2*t^4 + t^3 + 2*t^2 + t) / (t^6 + t^5 - 2*t^4 - 5*t^3 - 2*t^2 + t + 1).at n=21A180510
• Number of n X n 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column, diagonal or antidiagonal.at n=2A207275
• Number of nX3 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column, diagonal or antidiagonal.at n=2A207278
• T(n,k)=Number of nXk 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column, diagonal or antidiagonal.at n=12A207283
• Expansion of Product_{k>=1} 1 / (1 - 2*3^k*x^k).at n=6A300583
• Numbers k whose bi-unitary divisors have an even sum which is larger than 2k, but they cannot be partitioned into two disjoint parts whose sums are equal.at n=10A323342