66336

Appears in sequences

• Number of switching networks (see Harrison reference for precise definition).at n=2A000830
• a(n) contains n digits (either '3' or '6') and is divisible by 2^n.at n=4A053335
• Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n that have k returns to the x-axis (0<=k<=floor(n/2)). 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.at n=26A114692
• Number of ways of arranging 2*n tokens in a row, with 2 copies of each token from 1 through n, such that between every pair of tokens labeled i (i = 1..n-1) there is exactly one taken labeled i+1.at n=5A117513