Search Results for ""

A plane shape constructed by Reinhardt (1934) that is conjectured to be the "worst" packer of all centrally-symmetric plane regions. It has a packing density of ...

The continued fraction for mu is given by [1; 2, 4, 1, 1, 1, 3, 1, 1, 1, 2, 47, 2, ...] (OEIS A099803). The positions at which the numbers 1, 2, ... occur in the continued ...

Solid partitions are generalizations of plane partitions. MacMahon (1960) conjectured the generating function for the number of solid partitions was ...

Borwein et al. (2004, pp. 4 and 44) term the expression of the integrals I_1 = int_0^1x^xdx (1) = 0.783430510... (2) I_2 = int_0^1(dx)/(x^x) (3) = 1.291285997... (4) (OEIS ...

The sequence produced by sorting the digits of a number and adding them to the previous number. The values starting with n=1, 2, ... are 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

The maximal number of regions into which space can be divided by n planes is f(n)=1/6(n^3+5n+6) (Yaglom and Yaglom 1987, pp. 102-106). For n=1, 2, ..., these give the values ...

The number of regions into which space can be divided by n mutually intersecting spheres is N=1/3n(n^2-3n+8), giving 2, 4, 8, 16, 30, 52, 84, ... (OEIS A046127) for n=1, 2, ...

A sphenic number is a positive integer n which is the product of exactly three distinct primes. The first few sphenic numbers are 30, 42, 66, 70, 78, 102, 105, 110, 114, ... ...

A sphericon is the solid formed from a bicone with opening angle of 90 degrees (and therefore with a=r=h) obtained by slicing the solid with a plane containing the rotational ...

A square-free graph is a graph containing no graph cycles of length four. A simple graph is square-free iff c_4=1/8[Tr(A^4)-2m-2sum_(i!=j)a_(ij)^((2))]=0, where A is the ...