login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A233968
Number of steps between two valleys at height 0 in the infinite Dyck path in which the k-th ascending line segment has A141285(k) steps and the k-th descending line segment has A194446(k) steps, k >= 1.
3
2, 4, 6, 12, 16, 30, 38, 64, 84, 128, 166, 248, 314, 448, 576, 790, 1004, 1358, 1708, 2264, 2844, 3694, 4614, 5936, 7354, 9342, 11544, 14502, 17816, 22220, 27144, 33584, 40878, 50192, 60828, 74276, 89596, 108778, 130772, 157918, 189116, 227374
OFFSET
1,1
COMMENTS
Also first differences of A211978.
FORMULA
a(n) = 2*(A006128(n) - A006128(n-1)) = 2*A138137(n).
EXAMPLE
Illustration of initial terms as a dissection of a minimalist diagram of regions of the set of partitions of n, for n = 1..6:
. _ _ _ _ _ _
. _ _ _ |
. _ _ _|_ |
. _ _ | |
. _ _ _ _ _ | | |
. _ _ _ | |
. _ _ _ _ | | |
. _ _ | | |
. _ _ _ | | | |
. _ _ | | | |
. _ | | | | |
. | | | | | |
.
. 2 4 6 12 16 30
.
Also using the elements from the above diagram we can draw an infinite 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 n-th largest peak between two valleys at height 0 is also the partition number A000041(n).
7..................................
. /\
5.................... / \ /\
. /\ / \ /\ /
3.......... / \ / \ / \/
2..... /\ / \ /\/ \ /
1.. /\ / \ /\/ \ / \ /\/
0 /\/ \/ \/ \/ \/
. 2, 4, 6, 12, 16,...
.
KEYWORD
nonn
AUTHOR
Omar E. Pol, Jan 14 2014
STATUS
approved