Sequences

a(n) = n-th prime modulo 13.

a(n) = n-th prime modulo 14.

a(n) = n-th prime modulo 15.

a(n) = n-th prime modulo 16.

Primes modulo 17.

a(n) = prime(n)!.

Row sums of convolution triangle A030523.

Two-dimensional simplicial complexes on n labeled nodes.

Two-dimensional simplicial complexes on n unlabeled nodes.

Period of n-countdown club-passing juggling pattern.

a(1) = 1, a(m+1) = 2*Sum_{k=1..floor((m+1)/2)} a(m+1-k).

a(1) = 1, a(m+1) = 2*Sum_{k=1..floor((m+1)/2)} a(k).

Numbers in base -10.

a(n) is the negabinary expansion of n, that is, the expansion of n in base -2.

Even abundant numbers divided by 2.

Recursive prime generating sequence.

[ Even numbers in the sequence generated by b(n)=|b(n-1)+2b(n-2)-n| ], divided by 2.

(Even numbers in Hofstadter Q-sequence)/2.

[ Even numbers in the sequence generated by a(n)=a(a(n-2))+a(n-a(n-2)) ], divided by 2.

A050829 divided by 2.

a(n) = max{prime(n) mod q, where prime q < prime(n) = n-th prime}.

a(n) = s(n+1)/2, s=A039731.

a(n)=k such that prime(k) is the prime q<prime(n) for which (prime(n) mod q) is maximal.

a(n)=the prime q<prime(n) for which (prime(n) mod q) is maximal.

Triangle read by rows: T(n,k) = number of nonisomorphic unlabeled planar graphs with n >= 1 nodes and 0 <= k <= 3n-6 edges.

a(n) = number of primes q<p having (p mod q) = 2, where p = n-th prime.

a(n)=number of primes q<p having (p mod q)=3, where p=n-th prime.

a(n)=number of primes q<p having (p mod q)=4, where p=n-th prime.

a(n)=2*q-prime(n), where q is the prime < p(n) for which (prime(n) mod q) is maximal.

Lattice animals in the cubic diamond lattice (4 nearest neighbors), even-vertex-connected cubes.

Number of fixed n-celled lattice animals in the b.c.c. lattice (8 nearest neighbors), or connected truncated octahedra, or vertex-connected cubes.

Number of fixed n-celled lattice animals in the f.c.c. lattice (12 nearest neighbors), or connected rhombic dodecahedra, or edge-connected cubes.

Number k such that gcd(phi(k), k-1) = number of distinct prime factors of k.

Number of ways n*(n-1) can be partitioned into the sum of 2*(n-1) integers in the range 0..n.

Diameter of symmetric group S_n when generated by (1,2) and (1,2,3,...,n).

Row sums of triangle A049375.

Erroneous version of A003088.

Erroneous version of A051421.

Erroneous version of A001930.

Erroneous version of A058337.

Number of n-node graphs containing a 4-cycle.

Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).

Numbers common to A006145 and A039752.

Irregular triangle read by rows: T(n,k) = number of binary codes of length n with k words (n >= 0, 0 <= k <= 2^n); also number of 0/1-polytopes with vertices from the unit n-cube; also number of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group.

Triangle of B-analogs of Stirling numbers of the second kind.

Triangle of B-analogs of Stirling numbers of 2nd kind.

Triangle of coefficients in expansion of (x-1)*(x-3)*(x-5)*...*(x-(2*n-1)).

Triangle of B-analogs of Stirling numbers of first kind.

Number of edges in the Hasse diagrams for the B-analogs of the partition lattices.

Triangle of D-analogs of Stirling numbers of the 2nd kind.