65149296

Appears in sequences

• Stern's sequence: a(1) = 1, a(n+1) is the sum of the m preceding terms, where m*(m-1)/2 < n <= m*(m+1)/2 or equivalently m = ceiling((sqrt(8*n+1)-1)/2) = A002024(n).at n=28A005230
• First differences of Stern's sequence A005230.at n=28A066777
• a(n) is the number of weak ascent sequences (of any length) with n weak ascents.at n=7A369322