25386

Appears in sequences

• Number of connected labeled T_0-T_4-topologies with n points.at n=6A006059
• a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=100, a(2)=300.at n=20A104908
• Number of pairs of intersecting diagonals in the interior and exterior of a regular n-gon.at n=21A211380
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 462", based on the 5-celled von Neumann neighborhood.at n=42A272311
• Sum of the squarefree parts of the partitions of n into 5 parts.at n=39A309480
• Triangular array read by rows. T(n,k) is the number of inequivalent (as defined below) transitive binary relations R on [n] such that |domain(R intersect R^(-1))| = k, n>=0, 0<=k<=n.at n=22A369776