32886

Appears in sequences

• Number of strict 3rd-order maximal independent sets in cycle graph.at n=48A007392
• a(n) = floor(n(n-1)(n-2)(n-3)/20).at n=30A011930
• Start with 1, apply 1->12, 21->21, 22->21, 2->2 (for final 2); a(n) = length of n-th term.at n=32A013950
• A049031/2.at n=36A049032
• Stable Poincaré series [or Poincare series] for Lie algebra of type A (i.e., the variety of complex k X k matrices with distinct eigenvalues).at n=23A098787
• Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k nonroot branch nodes.at n=29A101431
• Index k of the first occurrence of A019565(2n-1) as the smallest term that makes prime(k)-A019565(2n-1) prime.at n=37A103792
• Number of permutations of length n which avoid the patterns 123, 2431, 4132.at n=15A116713
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 1 (n >= 0, k >= 0).at n=46A120981
• Triangle read by rows: T(n,k) is the number of hex trees with n edges and k pairs of adjacent vertices of outdegree 2.at n=19A126188
• Numbers k such that 17^k - 2 is a prime.at n=10A128459
• Triangle by rows T(n,k), showing the number of meanders with length (n+1)*4 and containing (k+1)*4 Ls and (n-k)*4 Rs, where Ls and Rs denote arcs of equal length and a central angle of 90 degrees which are positively or negatively oriented.at n=22A197653
• a(n) = binomial(n^2+n+1,n) * (n+1) / (n^2+n+1) for n>=0.at n=5A228509
• a(n) = 6*binomial(5*n + 6,n)/(5*n + 6).at n=5A233668
• Expansion of phi(-x^6) / f(-x) in powers of x where phi(), f() are Ramanujan theta functions.at n=46A271661
• Number of achiral dissections of a polygon into n hexagons by nonintersecting diagonals rooted at a cell.at n=11A370061
• Numbers k such that the sum of the proper divisors of k that have the same binary weight as k is larger than k, and no subset of these divisors sums to k.at n=14A381071