Search Results for ""

11 21 3 41 4 7 81 5 11 15 161 6 16 26 31 32 (1) The number triangle illustrated above (OEIS A008949) composed of the partial sums of binomial coefficients, a_(nk) = ...

Krall and Fink (1949) defined the Bessel polynomials as the function y_n(x) = sum_(k=0)^(n)((n+k)!)/((n-k)!k!)(x/2)^k (1) = sqrt(2/(pix))e^(1/x)K_(-n-1/2)(1/x), (2) where ...

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...

The bifoliate is the quartic curve given by the Cartesian equation x^4+y^4=2axy^2 (1) and the polar equation r=(8costhetasin^2theta)/(3+cos(4theta))a (2) for theta in [0,pi]. ...

The bifolium is a folium with b=0. The bifolium is a quartic curve and is given by the implicit equation is (x^2+y^2)^2=4axy^2 (1) and the polar equation ...

A binary bracketing is a bracketing built up entirely of binary operations. The number of binary bracketings of n letters (Catalan's problem) are given by the Catalan numbers ...

The "binary" Champernowne constant is obtained by concatenating the binary representations of the integers C_2 = 0.(1)(10)(11)(100)(101)(110)(111)..._2 (1) = ...

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...

A number is said to be biquadratefree (or quarticfree) if its prime factorization contains no quadrupled factors. All primes and prime powers p^n with n<=3 are therefore ...