62769

Appears in sequences

• a(n) = a(n-1) + 2*a(floor(n/2)) if n > 0, otherwise 1.at n=40A058039
• a(0)=1, a(n) = least k > a(n-1) such that k*a(n-1) is a triangular number.at n=26A213005
• Square array A(n,k) = A341526(A246278(n,k)), read by falling antidiagonals; Numerators of the columnwise first quotients of A341605/A341606.at n=24A341626