31739

Appears in sequences

• Combining the conditional divide-by-two concept from Collatz sequences with Pascal's triangle, we can arrive at a new kind of triangle. Start with an initial row of just 4. To compute subsequent rows, start by appending a zero to the beginning and end of the previous row. Like Pascal's triangle, add adjacent terms of the previous row to create each of the subsequent terms. The only change is that each term is divided by two if it is even. Then take the center of this triangle. In other words, take the n-th term from the (2n)th row.at n=19A123403
• Number of non-Fibonacci parts in the last section of the set of partitions of n.at n=42A144118
• a(n) = 60*n^2 - 1.at n=22A158670
• Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=2|x-y|-|y-z|.at n=35A212577
• Hilltop maps: number of nX3 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..2 nX3 array.at n=4A218228
• Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..2 nX5 array.at n=2A218230
• T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..2 nXk array.at n=23A218233
• T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..2 nXk array.at n=25A218233
• Number of (n+1) X 8 0..1 matrices with each 2 X 2 subblock idempotent.at n=13A224549
• a(n) is the length of stage n in A137844.at n=14A291754