Search Results for ""

A figurate number corresponding to a pentagonal pyramid. The first few are 1, 6, 18, 40, 75, ... (OEIS A002411). The generating function for the pentagonal pyramidal numbers ...

The absolute square of a complex number z, also known as the squared norm, is defined as |z|^2=zz^_, (1) where z^_ denotes the complex conjugate of z and |z| is the complex ...

Catalan's triangle is the number triangle 1 ; 1 1 ; 1 2 2 ; 1 3 5 5 ; 1 4 9 14 14 ; 1 5 14 28 42 42 ; 1 6 20 48 90 132 132 (1) (OEIS A009766) with entries given by ...

Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...

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 is called a super unitary perfect number if sigma^*(sigma^*(n))=2n, where sigma^*(n) is the unitary divisor function. The first few are 2, 9, 165, 238, 1640, ... ...

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...

The (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...