46428
domain: N
Appears in sequences
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the smallest number such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=15A049961
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n that have k valleys at level 1.at n=59A114489
- The Matula-Goebel numbers of the rooted trees that have palindromic Wiener polynomials.at n=27A198322