proposed
approved
proposed
approved
editing
proposed
proposed
approved
editing
proposed
editing
proposed
Also using the elements of this diagram we can draw a Dyck path in which the n-th odd-indexed segment has A141285(n) up-steps and the n-th even-indexed segment has A194446(n) down-steps. Note that the height of the n-th largest peak between two valleys at height 0 is also the partition number A000041(n). See below:
. 1, 3, 4, 9, 19, 33... = A179862
approved
editing
editing
approved
. 1, 3, 9, 19, 33... = A225594
approved
editing