Search Results for ""

The recursive sequence defined by the recurrence relation a(n)=a(a(n-1))+a(n-a(n-1)) (1) with a(1)=a(2)=1. The first few values are 1, 1, 2, 2, 3, 4, 4, 4, 5, 6, ... (OEIS ...

Homology is a concept that is used in many branches of algebra and topology. Historically, the term "homology" was first used in a topological sense by Poincaré. To him, it ...

The proof theories of propositional calculus and first-order logic are often referred to as classical logic. Intuitionistic propositional logic can be described as classical ...

The Jacobsthal numbers are the numbers obtained by the U_ns in the Lucas sequence with P=1 and Q=-2, corresponding to a=2 and b=-1. They and the Jacobsthal-Lucas numbers (the ...

Legendre-Gauss quadrature is a numerical integration method also called "the" Gaussian quadrature or Legendre quadrature. A Gaussian quadrature over the interval [-1,1] with ...

A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...

A function that arises in performance analysis of partially coherent, differentially coherent, and noncoherent communications. The generalized Marcum Q-function is defined by ...

The Motzkin numbers enumerate various combinatorial objects. Donaghey and Shapiro (1977) give 14 different manifestations of these numbers. In particular, they give the ...

An NSW number (named after Newman, Shanks, and Williams) is an integer m that solves the Diophantine equation 2n^2=m^2+1. (1) In other words, the NSW numbers m index the ...

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), ...