40814

Appears in sequences

• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=41A050051
• Triangle T(n,k) = A008517(n,k+1)+A008517(n,n+1-k) read by rows.at n=37A156141
• Triangle T(n,k) = A008517(n,k+1)+A008517(n,n+1-k) read by rows.at n=43A156141
• Number of edges in a graph of n adjacent rectangles in a row with all possible diagonals drawn, as in A306302, but without the rectangles' edges which are perpendicular to the row.at n=18A369177