Search Results for ""

A number which is simultaneously octagonal and hexagonal. Let O_n denote the nth octagonal number and H_m the mth hexagonal number, then a number which is both octagonal and ...

A number which is simultaneously octagonal and pentagonal. Let O_n denote the nth octagonal number and P_m the mth pentagonal number, then a number which is both octagonal ...

A number which is simultaneously octagonal and square. Let O_n denote the nth octagonal number and S_m the mth square number, then a number which is both octagonal and square ...

A number which is simultaneously octagonal and triangular. Let O_n denote the nth octagonal number and T_m the mth triangular number, then a number which is both octagonal ...

The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...

A Poulet number is a Fermat pseudoprime to base 2, denoted psp(2), i.e., a composite number n such that 2^(n-1)=1 (mod n). The first few Poulet numbers are 341, 561, 645, ...

Define a power difference prime as a number of the form n^n-(n-1)^(n-1) that is prime. The first few power difference primes then have n=2, 3, 4, 7, 11, 17, 106, 120, 1907, ...

An integer N which is a product of distinct primes and which satisfies 1/N+sum_(p|N)1/p=1 (Butske et al. 1999). The first few are 2, 6, 42, 1806, 47058, ... (OEIS A054377). ...

The prime distance pd(n) of a nonnegative integer n is the absolute difference between n and the nearest prime. It is therefore true that pd(p)=0 for primes p. The first few ...

Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...