Sequences

a(n) = sum of the numbers between the two n's in A026358.

a(n) = a(m) if a(m) has already occurred exactly once and n = a(m)+2m-1, else a(n) = least positive integer that has not yet occurred.

a(n) is the least k such that s(k) = n, where s = A026362.

a(n) = greatest k such that s(k) = n, where s = A026362.

Sum of the numbers between the two n's in A026362.

a(n) = a(m) if a(m) has already occurred exactly once and n = a(m)+2m, else a(n) = least positive integer that has not yet occurred.

a(n) = least k such that s(k) = n, where s = A026366.

a(n) = greatest k such that s(k) = n, where s = A026366.

a(n) = sum of the numbers between the two n's in A026366.

a(n) = a(m) if a(m) has already occurred exactly once and n = a(m)+2m+1, else a(n) = least positive integer that has not yet occurred.

a(n) = least k such that s(k) = n, where s = A026370.

a(n) = greatest k such that s(k) = n, where s = A026370.

a(n) = sum of the numbers between the two n's in A026370.

Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = k <= n-1, T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for even n and 1 <= k <= n-1.

a(n) = Sum_{k=0..n} binomial(n,k)*binomial(2*k,k).

a(n) is the number of integer strings s(0),...,s(n) counted by array T in A026374 that have s(n)=2; also a(n) = T(2n,n-1).

a(n) = number of integer strings s(0),...,s(n) counted by array T in A026374 that have s(n)=4; also a(n) = T(2n,n-2).

a(n) = number of integer strings s(0),...,s(n) counted by array T in A026374 that have s(n)=1; also a(n) = T(2n-1,n-1).

a(n) = number of integer strings s(0),...,s(n) counted by array T in A026374 that have s(n)=3; also a(n) = T(2n-1,n-2).

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

T(n,n-2), where T is the array in A026374.

a(n) = T(n,n-3), where T is the array in A026374.

a(n) = 5*a(n-2), starting 1,2.

a(n) = Sum_{j=0..i, i=0..n} T(i,j), where T is the array in A026374.

Sum{T(n-k,k)}, 0<=k<=[ n/2 ], where T is the array in A026374.

Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0; T(n,k) = T(n-1,k-1) + T(n-1,k) for even n and k = 1..n-1; T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for odd n and k = 1 ..n-1.

a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=0; also a(n) = T(2n,n).

a(n) is the number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=2; also a(n) = T(2n,n-1).

a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=4; also a(n) = T(2n,n-2).

Expansion of (2 + x + x^2)/((1 - x)*(1 - x - x^2)).

Expansion of 1/((1-2x)(1-6x)(1-7x)(1-10x)).

T(n,[ n/2 ]), where T is the array in A026386.

a(n) = T(n,n-2), where T is the array in A026386.

a(n) = T(n,n-3), where T is the array in A026386.

a(n) = 5*a(n-2), starting 1,2,4.

Sum_{T(i,j)}, 0<=j<=i, 0<=i<=n, where T is the array in A026386.

Sum{T(n-k,k)}, 0<=k<=[ n/2 ], where T is the array in A026386.

a(n) = greatest k such that s(j) > 0 for all j < k at end of stage n in forming A026400.

a(n) = s(k), where, at the end of stage n when forming A026400, k is the greatest integer such that s(j) > 0 for all j < k.

For n >= 1, n n's take places at stage n: the first n takes the least untaken place (l.u.p.) and for 2<=k<=n, the k-th n takes the l.u.p. at least (k-1)*n places past the place of the first n.

Position of the first n in A026400.

Position of the second n in A026400.

a(n) = position of the n-th n in A026400.

a(n) = greatest number of numbers between consecutive appearances of n in A026400.

a(n) = greatest integer not found after first n in A026400.

Numbers k such that A026400(k) is odd.

a(n) = greatest k such that s(j) > 0 for all j < k at end of stage n in forming A026409.

a(n) = s(k), where, at the end of stage n when forming A026409, k is the greatest integer such that s(j) > 0 for all j < k.

For n >= 1, n n's take places at stage n: the first takes the least untaken place (l.u.p) and for 2<=k<=n, the k-th n takes the l.u.p. more than n-1 places past the place of the (k-1)st n.

a(n) = position of the first n in A026409.