Sequences

a(n) = sum of the exponents in the prime factorization of LCM{1, n-1, ..., C(n-[ n/2 ],[ n/2 ])}.

a(n) = n!/LCM{1, C(n-1,1), C(n-2,2), ..., C(n-[ n/2 ],[ n/2 ])}.

a(n) = (1/1 + 1/(n-1) + ... + 1/C(n-[ n/2 ],[ n/2 ]))*L, where L = LCM{1, n-1, ..., C(n-[ n/2 ],[ n/2 ])}.

Triangular array, read by rows: pairwise sums of trinomial array A027907.

a(n) = T(n,n-1), where T is array defined in A025564.

a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = sum of numbers in row n+1 of the array T defined in A026105. Also a(n) = T(n,n), where T is the array defined in A025564.

a(n) = T(n,n+1), where T is the array defined in A025564.

a(n) = T(n,n+2) where T is the array defined in A025564.

T(2n-1,n), where T is the array defined in A025564.

a(n) = T(2n,n), where T is the array defined in A025564.

a(n) = T(3n,n), where T is the array defined in A025564.

a(n) = T(4n,n), where T is the array defined in A025564.

a(n) = T(2n,n-1), where T is the array defined in A025564.

T(2n,n+1), where T is the array defined in A025564.

a(n) = T(n,[ n/2 ]), where T is the array defined in A025564.

a(n) = T(n,[ n/2 ]+1), where T is the array defined in A025564.

Expansion of (x/(1-x))*sqrt((1+x)/(1-3*x)).

a(n) = Sum{T(n,k-1), k = 1,2,...,n}.

a(1)=1, a(2)=2, a(n) = 4*3^(n-3) for n >= 3.

a(n) = (1/1 - 1/(n-1) + ... + d/binomial(n-[ n/2 ],[ n/2 ]))*L, where L = LCM{1, n-1, ..., binomial(n-[ n/2 ],[ n/2 ])}, d = (-1)^n.

Triangle read by rows: T(n, k) = n-k, for 0 <= k <= n.

A B_2 sequence: a(n) is the least value such that sequence increases and pairwise sums of elements are all distinct.

Composite numbers that are not the sum of 2 primes.

Primes p such that p-2 is not a prime.

Central Eulerian numbers A(2n-1,n).

Largest value in '3x+1' trajectory of n.

'3x+1' record-setters (blowup factor).

Number of n-move self-avoiding knight paths on 4 X 4 board, beginning at corner.

Number of n-move self-avoiding knight paths on 5 X 5 board, beginning at corner.

Number of n-move self-avoiding knight paths on 6x6 board, beginning at corner.

Maximal coefficient of Product_{k<=n} (1 + x^k). Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0 or 1.

Number of n-move bishop paths on 8x8 board from given corner to any square.

Number of n-move bishop paths on 8x8 board from given corner to same corner.

Number of n-move bishop paths on 8x8 board from given corner to opposite corner.

Number of n-move king paths on 8 X 8 board from given corner to any square.

Number of n-move king paths on 8x8 board from given corner to same corner.

Number of n-move king paths on 8 X 8 board from given corner to opposite corner.

Number of n-move king paths on 8 X 8 board from given corner to adjacent corner.

Number of n-move knight paths on 8 X 8 board from given corner to any square.

Number of n-move knight paths on 8 X 8 board from given corner to same corner.

Number of n-move knight paths on 8 X 8 board from given corner to opposite corner.

Number of n-move knight paths on 8x8 board from given corner to adjacent corner.

Number of n-move queen paths on 8x8 board from given corner to any square.

Number of n-move queen paths on 8x8 board from given corner to same corner.

Number of n-move queen paths on 8x8 board from given corner to opposite corner.

Number of n-move queen paths on 8x8 board from given corner to adjacent corner.

Number of n-move rook paths on 8 X 8 board from given corner to same corner.

Number of n-move rook paths on 8 X 8 board from given corner to opposite corner.

Number of n-move rook paths on 8 X 8 board from given corner to adjacent corner.

Numbers of form 2^i*6^j, with i, j >= 0; equivalently, numbers of the form 2^i*3^j with 0 <= j <= i.