Search Results for ""

The sequence 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ... (OEIS A002024) consisting of 1 copy of 1, 2 copies of 2, 3 copies of 3, and so on. Surprisingly, there exist simple formulas ...

A self-dual graphs is a graph that is dual to itself. Wheel graphs are self-dual, as are the examples illustrated above. Naturally, the skeleton of a self-dual polyhedron is ...

A mathematical object defined for a set and a binary operator in which the multiplication operation is associative. No other restrictions are placed on a semigroup; thus a ...

A separating family is a set of subsets in which each pair of adjacent elements are found separated, each in one of two disjoint subsets. The 26 letters of the alphabet can ...

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...

Serret's integral is given by int_0^1(ln(x+1))/(x^2+1)dx = 1/8piln2 (1) = 0.272198... (2) (OEIS A102886; Serret 1844; Gradshteyn and Ryzhik 2000, eqn. 4.291.8; Boros and Moll ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...

Define f(x_1,x_2,...,x_n) with x_i positive as f(x_1,x_2,...,x_n)=sum_(i=1)^nx_i+sum_(1<=i<=k<=n)product_(j=i)^k1/(x_j). (1) Then minf=3n-C+o(1) (2) as n increases, where the ...

Consider the sum (1) where the x_js are nonnegative and the denominators are positive. Shapiro (1954) asked if f_n(x_1,x_2,...,x_n)>=1/2n (2) for all n. It turns out ...

The set of all planes through a line. The line is sometimes called the axis of the sheaf, and the sheaf itself is sometimes called a pencil (Altshiller-Court 1979, p. 12; ...