Search Results for ""

A (-1,1)-matrix is a matrix whose elements consist only of the numbers -1 or 1. For an n×n (-1,1)-matrix, the largest possible determinants (Hadamard's maximum determinant ...

Feynman (1997, p. 116) noticed the curious fact that the decimal expansion 1/(243)=0.004115226337448559... (1) repeats pairs of the digits 0, 1, 2, 3, ... separated by the ...

The number of ways a set of n elements can be partitioned into nonempty subsets is called a Bell number and is denoted B_n (not to be confused with the Bernoulli number, ...

A centered polygonal number consisting of a central dot with four dots around it, and then additional dots in the gaps between adjacent dots. The general term is n^2+(n+1)^2, ...

The fibonorial n!_F, also called the Fibonacci factorial, is defined as n!_F=product_(k=1)^nF_k, where F_k is a Fibonacci number. For n=1, 2, ..., the first few fibonorials ...

A set of n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). The numbers ...

A general formula giving the number of distinct ways of folding an m×n rectangular map is not known. A distinct folding is defined as a permutation of N=m×n numbered cells ...

The Mephisto waltz sequence is defined by beginning with 0 and then iterating the maps 0->001 and 1->110. This gives 0, 001, 001001110, 001001110001001110110110001, ... (OEIS ...

A number which is simultaneously a nonagonal number N_m and a triangular number T_n and therefore satisfies the Diophantine equation. 1/2m(7m-5)=1/2n(1+n). (1) Completing the ...

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...