43263

Appears in sequences

• Fermat coefficients.at n=8A000973
• a(n) = binomial(3*n,n)/(2*n+1) (enumerates ternary trees and also noncrossing trees).at n=8A001764
• a(n) = floor(binomial(n,7)/8).at n=24A011844
• Number of proper factorizations of p1^n*p2^4, where p1 and p2 are distinct primes.at n=19A031127
• Irreducible Euler sums of weight 8 and depth 10+2n.at n=16A031164
• Number of necklaces with 8 black beads and n-8 white beads.at n=17A032193
• Schoenheim bound L_1(n,8,7).at n=16A036835
• 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=16A047749
• Number of dissectable polyhedra with n tetrahedral cells and symmetry of type F.at n=30A047760
• a(n) = A047760(2n+1).at n=15A047761
• Number of dissectable polyhedra with n tetrahedral cells and symmetry of type D.at n=46A047773
• Number of dissectable polyhedra with n tetrahedral cells and symmetry of type D.at n=48A047773
• a(n) = ceiling(binomial(n,8)/n).at n=24A053731
• Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n.at n=39A057257
• A sequence related to numeric partitions and Fermat Coefficients.at n=17A059251
• A triangle (lower triangular matrix) composed of Pfaff-Fuss (or Raney) sequences.at n=46A062993
• Triangle read by rows: T(n,k) = binomial(3n+3, k)*(n-k+1)/(n+1).at n=35A064282
• 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=52A069269
• 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=44A069269
• Array read by antidiagonals giving number of paths up and left from (0,0) to (n,kn) where x/y <= k for all intermediate points.at n=63A070914