Sequences

n written in fractional base 10/6.

n written in fractional base 10/7.

n written in fractional base 10/8.

n written in fractional base 10/9.

Positions of even numbers in A003325.

Positions of odd numbers in A003325.

a(n) = position of 2*n^3 in A003325.

Position of 1 + n^3 in A003325.

Position of n^3 + (n+1)^3 in A003325.

Numbers that are sums of 2 distinct positive cubes.

Positions of even numbers in A024670 (distinct sums of cubes of distinct positive integers).

Positions of odd numbers in A024670 (distinct sums of cubes of distinct positive integers).

Position of 1 + n^3 in A024670 (distinct sums of cubes of distinct positive integers).

a(n) = position of n^3 + (n+1)^3 in A024670 (distinct sums of cubes of distinct positive integers).

Average of two consecutive odd primes.

a(n) is the number of prime divisors (counted by multiplicity) of A024675(n).

Smallest prime divisor of n-th terms of sequence A024675 (averages of two consecutive odd primes).

a(n) is the position of (prime(n+1) + prime(n+2))/2 in the ordered nonprimes.

Positions of primes in A003136 (ordered distinct numbers i^2 - i*j + j^2).

Number of ways prime(n) is a sum of 3 odd nonprimes r,s,t satisfying 1 <= r < s < t.

a(n) = number of ways p(n) is a sum of 3 odd nonprimes r,s,t satisfying 9 <= r < s < t.

a(n) = number of ways p(n) is a sum of 3 odd nonprimes r,s,t satisfying 15 <= r < s < t.

a(n) is the number of ways prime(n) is a sum of two composite numbers r,s satisfying r < s.

Number of ways prime(n) is a sum of three distinct primes.

a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence).

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A000201 (lower Wythoff sequence), t = A023533.

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A014306.

a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence).

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A001950 (upper Wythoff sequence), t = A023533.

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence), t = A014306.

a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = floor((n+1)/2), s = A023533.

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023533, t = A014306.

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023533, t = A000040.

s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A014306.

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).

a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n+1-k), where k = [ (n+1)/2 ], p = A000040 = the primes.

a(n) = (prime(n+1) - 1)/4 if this is an integer or (prime(n+1) + 1)/4 otherwise.

a(n) = (prime(n+2)-1)/6 if this is an integer or (prime(n+2)+ 1)/6 otherwise.

a(n) = (prime(n+2)^2 - 1)/3.

a(n) = (-1 + prime(n+1)^2)/4.

a(n) = (prime(n)^2 - 1)/24.

Prime divisors, including repetitions, of n-th term of A024702.

Positions of even numbers in A024702.

Positions of odd numbers in A024702.

Positions of multiples of 3 in A024702.

Positions of multiples of 5 in A024702.

Number of distinct prime divisors of n-th term of A024702.

Least prime divisor of A024702(n).

Greatest prime divisor of A024702(n).