Search Results for ""

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...

Another word for monotonic.

Polynomials s_k(x) which form the Sheffer sequence for f(t)=-(2t)/(1-t^2) (1) and have exponential generating function ...

A number n for which the product of divisors is equal to n^2. The first few are 1, 6, 8, 10, 14, 15, 21, 22, ... (OEIS A007422).

The Narayana triangle is the number triangle obtained from the Narayana numbers N(n,k), namely 1 ; 1 1 ; 1 3 1 ; 1 6 6 1 ; 1 10 20 10 1 ; 1 15 50 50 15 1 (OEIS A001263).

A group G is nilpotent if the upper central sequence 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... of the group terminates with Z_n=G for some n. Nilpotent groups have the property that ...

The number of nonassociative n-products with k elements preceding the rightmost left parameter is F(n,k) = F(n-1,k)+F(n-1,k-1) (1) = (n+k-2; k)-(n+k-1; k-1), (2) where (n; k) ...

A positive value of n for which x-phi(x)=n has no solution, where phi(x) is the totient function. The first few are 10, 26, 34, 50, 52, ... (OEIS A005278).

A positive even value of n for which phi(x)=n, where phi(x) is the totient function, has no solution. The first few are 14, 26, 34, 38, 50, ... (OEIS A005277).

A normal series of a group G is a finite sequence (A_0,...,A_r) of normal subgroups such that I=A_0<|A_1<|...<|A_r=G.