Search Results for ""

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...

The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...

An (n,k)-talisman hexagon is an arrangement of nested hexagons containing the integers 1, 2, ..., H_n=3n(n-1)+1, where H_n is the nth hex number, such that the difference ...

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...

Start with an integer n, known as the digitaddition generator. Add the sum of the digitaddition generator's digits to obtain the digitaddition n^'. A number can have more ...

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

The W polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. (The corresponding w polynomials are called Lucas polynomials.) They have explicit ...

The total number of contravariant and covariant indices of a tensor. The rank R of a tensor is independent of the number of dimensions N of the underlying space. An intuitive ...

A New Kind of Science is a seminal work on simple programs by Stephen Wolfram. In 1980, Wolfram's studies found unexpected behavior in a collection of simple computer ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...