Search Results for ""

d sum OEIS 0 23.10344 A082839 1 16.17696 A082830 2 19.25735 A082831 3 20.56987 A082832 4 21.32746 A082833 5 21.83460 A082834 6 22.20559 A082835 7 22.49347 A082836 8 22.72636 ...

The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...

The norm of a mathematical object is a quantity that in some (possibly abstract) sense describes the length, size, or extent of the object. Norms exist for complex numbers ...

A stochastic matrix, also called a probability matrix, probability transition matrix, transition matrix, substitution matrix, or Markov matrix, is matrix used to characterize ...

A temporal point process is a random process whose realizations consist of the times {tau_j}_(j in J) of isolated events. Note that in some literature, the values tau_j are ...

The first few terms in the continued fraction of the Champernowne constant are [0; 8, 9, 1, 149083, 1, 1, 1, 4, 1, 1, 1, 3, 4, 1, 1, 1, 15, 45754...10987, 6, 1, 1, 21, ...] ...

A nonplanar graph is a graph that is not planar. The numbers of simple nonplanar graphs on n=1, 2, ... nodes are 0, 0, 0, 0, 1, 14, 222, 5380, 194815, ... (OEIS A145269), ...

An n×n Latin square is a Latin rectangle with k=n. Specifically, a Latin square consists of n sets of the numbers 1 to n arranged in such a way that no orthogonal (row or ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...