120175

Appears in sequences

• a(n) = binomial(3*n+1,n)/(n+1).at n=8A006013
• a(n) = floor( binomial(n,8)/9).at n=25A011845
• Number of necklaces with 9 black beads and n-9 white beads.at n=17A032194
• Schoenheim bound L_1(n,9,8).at n=16A036836
• Duplicate of A006013.at n=8A046648
• Triangle of rooted planar maps, read by rows.at n=44A046652
• If n = 2*m then a(n) = binomial(3*m, m)/(2*m+1), if n=2*m+1 then a(n) = binomial(3*m+1, m+1)/(2*m+1).at n=17A047749
• Number of dissectable polyhedra with n tetrahedral cells and symmetry of type I.at n=68A047753
• Duplicate of A047767.at n=17A047756
• Number of dissectable polyhedra with n tetrahedral cells and symmetry of type P.at n=33A047765
• a(n) = A047765(2n).at n=16A047767
• Number of dissectable polyhedra with n tetrahedral cells and symmetry of type D.at n=51A047773
• a(n) = ceiling(binomial(n,9)/n).at n=25A053733
• a(n) = Sum_{d|n} phi(d^4).at n=23A068970
• Second level generalization of Catalan triangle (0th level is Pascal's triangle A007318; first level is Catalan triangle A009766; 3rd level is A069270).at n=53A069269
• Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.at n=44A071948
• Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=A006013(n), a(n+1,n)=A001764(n+1), a(n,m) = Sum A001764(n-k)*a(n,k), k=0..m.at n=36A073148
• Triangle read by rows: T(n,k) is the number of nonseparable planar maps with 2*n+1 edges and a fixed outer face of 2*k edges which are invariant under a rotation of a 1/2 turn.at n=36A091665
• Triangle read by rows: T(n,k) is the number of noncrossing trees with root degree equal to k.at n=36A092276
• Triangle read by rows: T(n,k) is number of leaves at level k in all noncrossing rooted trees on n+1 nodes.at n=36A101372