36898

Appears in sequences

• Number of trees in an n-node wheel.at n=24A002985
• Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n and having k ascents (n>=1; 0<=k<=n-1). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1. An ascent in a Schroeder path is a maximal sequence of consecutive U steps.at n=40A114706
• Number of partitions of n such that (greatest part) - (least part) > number of parts.at n=44A237833
• Number of ways to transform a sequence of n ones to a single number by continually removing two numbers and replacing them with their sum modulo 3.at n=14A276027