Search Results for ""

Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...

Betti numbers are topological objects which were proved to be invariants by Poincaré, and used by him to extend the polyhedral formula to higher dimensional spaces. ...

Let F_n be the nth Fibonacci number. Then the sequence {F_n}_(n=2)^infty={1,2,3,5,8,...} is complete, even if one is restricted to subsequences in which no two consecutive ...

A 3-multiperfect number P_3. Six sous-doubles are known (120, 672, 523776, 459818240, 1476304896, and 51001180160; OEIS A005820), and these are believed to comprise all ...

A 4-multiperfect number P_4. 36 sous-triples are known (30240, 32760, 2178540, 23569920, ...; OEIS A027687), and these are believed to comprise all sous-triples.

1000=10^3. The word "thousand" appears in common expressions in a number of languages, for example, "a thousand pardons" in English and "tusen takk" ("a thousand thanks") in ...

A Stoneham number is a number alpha_(b,c) of the form alpha_(b,c)=sum_(k=1)^infty1/(b^(c^k)c^k), where b,c>1 are relatively prime positive integers. Stoneham (1973) proved ...

A Thâbit ibn Kurrah number, sometimes called a 321-number, is a number of the form K_n=3·2^n-1. The first few for n=0, 1, ... are 2, 5, 11, 23, 47, 95, 191, 383, 767, ... ...

A number is said to be simply normal to base b if its base-b expansion has each digit appearing with average frequency tending to b^(-1). A normal number is an irrational ...

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