Sequences

n-th 8k+1 prime plus n-th 8k+7 prime.

(n-th 8k+1 prime plus n-th 8k+7 prime)/8.

n-th 8k+3 prime plus n-th 8k+5 prime.

(n-th 8k+3 prime plus n-th 8k+5 prime)/8.

Ordered sequence of distinct terms of the form floor(exp(i) * floor(exp(j))), i,j >= 0.

Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = e/2.

Ordered sequence of distinct terms of the form floor(Pi^i * floor(Pi^j)), i, j >= 0.

Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), where x = sqrt(2).

Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = sqrt(3).

Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = sqrt(5).

Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = sqrt(7).

Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = sqrt(3/2).

Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = log(5).

Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = (1+sqrt(5))/2.

Place where n-th 1 occurs in A007336.

Place where n-th 1 occurs in A023115.

Place where n-th 1 occurs in A007337.

Place where n-th 1 occurs in A023116.

Place where n-th 1 occurs in A023117.

Place where n-th 1 occurs in A023118.

Place where n-th 1 occurs in A023119.

Place where n-th 1 occurs in A023120.

Place where n-th 1 occurs in A023121.

Place where n-th 1 occurs in A023122.

Place where n-th 1 occurs in A023123.

Place where n-th 1 occurs in A023124.

Place where n-th 1 occurs in A023125.

Place where n-th 1 occurs in A023126.

Place where n-th 1 occurs in A023127.

Place where n-th 1 occurs in A023128.

Place where n-th 1 occurs in A023129.

Place where n-th 1 occurs in A023130.

Place where n-th 1 occurs in A023131.

Place where n-th 1 occurs in A023132.

Place where n-th 1 occurs in A023133.

Place where n-th 1 occurs in A023134.

a(n) = n-th prime + n-th nonprime.

a(n) = P(n) + c(n), where P(1) = 1, P(n) = (n-1)-st prime for n >= 2, c(n) = n-th number not in sequence P.

a(n) = F(n+1) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th non-Fibonacci number.

a(n) = F(n+2) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or is a non-Fibonacci number.

n-th Lucas number (A000204(n)) + n-th non-Lucas number (A090946(n+1)).

a(n) = L(n+1) + c(n) where L(k) = k-th Lucas number and c(n) is n-th number that is 1 or not a Lucas number.

Numbers that reach ...,7,8,4,2,1 under the mapping: if n is even divide by 2 else add 1.

a(n) = B(n) + c(n) where B(n) is Beatty sequence [ n*sqrt(2) ] and c is the complement of B.

a(n) = B(n) + C(n) where B(n) is Beatty sequence [ n*sqrt(3) ] and C is complement of B.

a(n) = B(n) + c(n) where B(n) is Beatty sequence [ n*e ] and c is the complement of B.

a(n) = S(n) + c(n) where S(n) = [ n*sqrt(2) ] + [ n*sqrt(3) ] and c is the complement of S.

a(n) = S(n) + c(n) where S(n) = [ (3/2)^n ] and c is the complement of S.

a(n) = F(n+3) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or 2 or is not a Fibonacci number.

a(n) = L(n+2) + c(n) where L(k) is the k-th Lucas number and c(n) is the n-th number that is 1 or 3 or is not a Lucas number.