28384
domain: N
Appears in sequences
- Number of nonequivalent dissections of an n-gon into n-3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=8A003447
- Number of edges in the Hasse diagrams for the B-analogs of the partition lattices.at n=6A039759
- Numbers n such that the sum of the digits of n^phi(n) is divisible by n.at n=27A109660
- E.g.f. A(x) satisfies A(x) = (1 + (Integral A(x) dx)^2 / 2)^2.at n=4A120419
- Sum of all the parts in the partitions of n into 9 parts.at n=32A326464
- Indices of unique values in A329152.at n=31A333268
- Place two n-gons with radii 1 and 2 concentrically, forming an annular area between them. Connect all the vertices with line segments that lie entirely within that area. Then a(n) is the number of vertices in that figure.at n=29A337701
- E.g.f. A(x) satisfies A(x) = exp( 2 * x * cosh(x * A(x)) ).at n=6A381408