Search Results for ""

11 21 8 61 22 58 241 52 328 444 1201 114 1452 4400 3708 7201 240 5610 32120 58140 33984 5040 (1) The second-order Eulerian triangle (OEIS A008517) is the number triangle ...

Let x be a positive number, and define lambda(d) = mu(d)[ln(x/d)]^2 (1) f(n) = sum_(d)lambda(d), (2) where the sum extends over the divisors d of n, and mu(n) is the Möbius ...

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 ...

The semiperimeter on a figure is defined as s=1/2p, (1) where p is the perimeter. The semiperimeter of polygons appears in unexpected ways in the computation of their areas. ...

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 ...