Search Results for ""

A composite number defined analogously to a Smith number except that the sum of the number's digits equals the sum of the digits of its distinct prime factors (excluding 1). ...

The sequence defined by G(0)=0 and G(n)=n-G(G(n-1)). (1) The first few terms for n=1, 2, ... are 1, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, ... (OEIS A005206). This can be ...

The pair of sequences defined by F(0)=1, M(0)=0, and F(n) = n-M(F(n-1)) (1) M(n) = n-F(M(n-1)). (2) The first few terms of the "male" sequence M(n) for n=0, 1, ... are 0, 0, ...

Honaker's problem asks for all consecutive prime number triples (p,q,r) with p<q<r such that p|(qr+1). Caldwell and Cheng (2005) showed that the only Honaker triplets for ...

Hyperreal numbers are an extension of the real numbers to include certain classes of infinite and infinitesimal numbers. A hyperreal number x is said to be finite iff |x|<n ...

By way of analogy with the eban numbers, iban numbers are defined as numbers whose English names do not contain the letter "i" (i.e., "i" is banned). The first few are 1, 2, ...

The idempotent numbers are given by B_(n,k)(1,2,3,...)=(n; k)k^(n-k), where B_(n,k) is a Bell polynomial and (n; k) is a binomial coefficient. A table of the first few is ...

The identity function id(x) is the function id(x)=x which assigns every real number x to the same real number x. It is identical to the identity map. The identity function is ...

A riffle shuffle, in which the top half of the deck is placed in the left hand, and cards are then alternatively interleaved from the left and right hands. Using an ...

An indicial equation, also called a characteristic equation, is a recurrence equation obtained during application of the Frobenius method of solving a second-order ordinary ...