Search Results for ""

The sum of the aliquot divisors of n, given by s(n)=sigma(n)-n, where sigma(n) is the divisor function. The first few values are 0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, ... ...

An even number of the form 4n+2 (i.e., an integer which is divisible by 2 but not by 4). The first few for n=0, 1, 2, ... are 2, 6, 10, 14, 18, ... (OEIS A016825)

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...

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.

A link L is said to be splittable if a plane can be embedded in R^3 such that the plane separates one or more components of L from other components of L and the plane is ...

Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...

A Poulet number whose divisors d all satisfy d|2^d-2. The first few are 341, 1387, 2047, 2701, 3277, 4033, 4369, 4681, 5461, 7957, 8321, ... (OEIS A050217).

Szemerédi's theorem states that every sequence of integers that has positive upper Banach density contains arbitrarily long arithmetic progressions. A corollary states that, ...

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.