111808
domain: N
Appears in sequences
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=18A049924
- Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UH, HH and HD.at n=20A329700