Search Results for ""

The number of digits D in an integer n is the number of numbers in some base (usually 10) required to represent it. The numbers 1 to 9 are therefore single digits, while the ...

Let u_(B,b)(n) be the number of digit blocks of a sequence B in the base-b expansion of n. The following table gives the sequence {u_(B)(n)} for a number of blocks B. B OEIS ...

The number N_d^((b))(n) of digits d in the base-b representation of a number n is called the b-ary digit count for d. The digit count is implemented in the Wolfram Language ...

Let s_b(n) be the sum of the base-b digits of n, and epsilon(n)=(-1)^(s_2(n)) the Thue-Morse sequence, then product_(n=0)^infty((2n+1)/(2n+2))^(epsilon(n))=1/2sqrt(2).

A digit sum s_b(n) is a sum of the base-b digits of n, which can be implemented in the Wolfram Language as DigitSum[n_, b_:10] := Total[IntegerDigits[n, b]]The following ...

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 ...

An integer used to generate a digitaddition. A number can have more than one generator. If a number has no generator, it is called a self number.

Consider the process of taking a number, taking its digit sum, then adding the digits of numbers derived from it, etc., until the remaining number has only one digit. The ...

The digon is the degenerate polygon (corresponding to a line segment) with Schläfli symbol {2}.

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...