Sequences

Continued fraction for sqrt(15).

Continued fraction for sqrt(17).

Continued fraction for sqrt(18).

Number of primes < e^n.

Continued fraction for sqrt(20).

Largest prime < e^n.

Prime 3 followed by unique period primes (the period r of 1/p is not shared with any other prime) of the form A019328(r)/gcd(A019328(r),r) in order (periods r are given in A051627).

(Number of permutations of {1,2,...,n} for which sums of adjacent numbers are all distinct)/2n.

Continued fraction for sqrt(24).

Continued fraction for sqrt(26).

Continued fraction for sqrt(27).

Continued fraction for sqrt(28).

Continued fraction expansion of Pi*exp(2*Pi-Pi^2/2).

Continued fraction for sqrt(30).

a(n) is the number of prime palindromes with 2n+1 digits.

If n=r*2^s, r odd, then a(n)=t*r, where t is smallest (in magnitude) number such that 1=t*r+u*2^s.

The Gould numbers.

Primes p such that x^3 = 2 has a solution mod p.

Continued fraction for sqrt(35).

Continued fraction for sqrt(37).

Continued fraction for sqrt(38).

Continued fraction for sqrt(39).

Continued fraction for sqrt(40).

Primes p such that x^3 = 2 has no solution mod p.

Continued fraction for sqrt(42).

Primes p such that x^3 = 3 has a solution mod p.

Continued fraction for sqrt(44).

Primes p such that x^3 = 3 has no solution mod p.

First differences of A033485; also A033485 with terms repeated.

Average of twin prime pairs (A014574), divided by 2. Equivalently, 2*a(n)-1 and 2*a(n)+1 are primes.

Continued fraction for sqrt(48).

Continued fraction for sqrt(50) = 5*sqrt(2).

Continued fraction for sqrt(51).

Primes p such that x^3 = 5 has a solution mod p.

Primes p such that x^3 = 5 has no solution mod p.

Primes p such that x^3 = 6 has a solution mod p.

Primes p such that x^3 = 6 has no solution mod p.

Continued fraction for sqrt(56).

Primes p such that x^3 = 7 has a solution mod p.

Primes p such that x^3 = 7 has no solution mod p.

Parity of partition function A000041.

Continued fraction for sqrt(60).

a(n) is 1 if and only if Ramanujan's tau(n) > 0.

Primes p such that x^3 = 10 has a solution mod p.

Continued fraction for sqrt(63).

Continued fraction for sqrt(65).

Continued fraction for sqrt(66).

Primes p such that x^3 = 10 has no solution mod p.

Continued fraction for sqrt(68).

Primes p such that x^3 = 11 has a solution mod p.