Search Results for ""

A multiplication table is an array showing the result of applying a binary operator to elements of a given set S. For example, the following table is the multiplication table ...

A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...

The continued fraction for Apéry's constant zeta(3) is [1; 4, 1, 18, 1, 1, 1, 4, 1, ...] (OEIS A013631). The positions at which the numbers 1, 2, ... occur in the continued ...

Let a_1=1 and define a_(n+1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This ...

The base-4 method of counting in which only the digits 0, 1, 2, and 3 are used. The illustration above shows the numbers 0 to 63 represented in quaternary, and the following ...

The tridiminished icosahedron is Johnson solid J_(63). Interestingly, its skeleton has the same degree sequence as the triangular cupola.

A rational quadrilateral is a quadrilateral for which the sides, polygon diagonals, and area are rational. The simplest case has sides a=52, b=25, c=39, and d=60, polygon ...

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...

The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...