Sequences

Primes with primitive root 89.

Primes with primitive root 90.

Primes with primitive root 91.

Primes with primitive root 92.

Primes with primitive root 93.

Primes with primitive root 94.

Primes with primitive root 95.

Primes with primitive root 96.

Primes with primitive root 97.

Primes with primitive root 98.

Primes with primitive root 99.

Numbers whose sum of divisors is a fourth power.

Numbers whose sum of divisors is a fifth power.

Numbers whose sum of divisors is a sixth power.

Continued fraction for tan(1/2).

Continued fraction for tan(1/3).

Continued fraction for tan(1/4).

Continued fraction for tan(1/5).

Continued fraction for tan(1/6).

Continued fraction for tan(1/7).

Continued fraction for tan(1/8).

Continued fraction for tan(1/9).

Continued fraction for tan(1/10).

Fermat primes: primes of the form 2^(2^k) + 1, for some k >= 0.

Numbers k at which the fractional part of tan(k) reaches a record high.

Size of smallest directed 1-covering code of length n with banded structure.

a(n) = a(n-1)!/a(n-2)!; a(0) = 1, a(1) = 3.

Squarefree orders of elements of Mathieu group M_23.

Number of ways of tiling a 2 X n rectangle with dominoes and trominoes.

Integers in alphabetical order in British English.

Coefficients in generating function for radius of gyration of the sequence A066158.

Numbers m such that a Hadamard matrix of order m exists.

Expansion of 1/((1-4x)(1-6x)(1-9x)).

a_1, a_2, ..., is a permutation of the positive integers such that the average of each initial segment is an integer, using the greedy algorithm to define a_n.

Form a permutation of the positive integers, p_1, p_2, ..., such that the average of each initial segment is an integer, using the greedy algorithm to define p_n; sequence gives p_1 + ... + p_n.

a(n) = ceiling(n/tau), where tau = (1+sqrt(5))/2.

Number of monomials in expansion of determinant of an n X n Toeplitz matrix [ t(|i-j|) ] in terms of its entries.

Number of monomials in expansion of determinant of an n X n Hankel matrix [ t(i+j) ] in terms of its entries.

Irreducible quadruple Euler sums of weight 2n+10 (verified for n <= 14).

Conjectured formula for irreducible 5-fold Euler sums of weight 2n+13.

Coordination sequence T1 for Zeolite Code CGF.

Coordination sequence T2 for Zeolite Code CGF.

Coordination sequence T3 for Zeolite Code CGF.

Coordination sequence T4 for Zeolite Code CGF.

Coordination sequence T5 for Zeolite Code CGF.

Coordination sequence T1 for Zeolite Code CZP.

Coordination sequence T2 for Zeolite Code CZP.

Coordination sequence T3 for Zeolite Code CZP.

Conjectured formula for irreducible 6-fold Euler sums of weight 2n+16.

Add 1, multiply by 1, add 2, multiply by 2, etc., start with 2.