Sequences

a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)) for n > 1, a(1) = 3.

a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)) for n > 1, a(1) = 4.

Number of series-reduced labeled trees with n nodes.

Number of n-bead bracelets (turnover necklaces) of two colors with 6 red beads and n-6 black beads.

Number of n-bead bracelets (turnover necklaces) with 8 red beads and n-8 black beads.

Number of n-bead bracelets (turnover necklaces) of two colors with 10 red beads and n-10 black beads.

Number of n-bead bracelets (turnover necklaces) with 12 red beads.

Smallest label f(T) given to a rooted tree T with n nodes in Matula-Goebel labeling.

Largest label f(T) given to a rooted tree T with n nodes in Matula-Goebel labeling.

Let T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (A049429, A049430); sequence gives Sum_{d} T(n,d).

Smallest number of complexity n: smallest number requiring n 1's to build using + and *.

1 + (sum of first n odd primes - n)/2.

a(n) = 1 + L(n) + F(2*n-1) with {L(n)}_{n>=0} the Lucas numbers (A000032) and F(2*n-1)_{n>=0} the bisected Fibonacci numbers (A001519).

a(n) = maximal number of rational points on an elliptic curve over GF(q), where q = A246655(n) is the n-th prime power > 1.

Values k arising from a construction of Hirschfeld of k-arcs on elliptic curves over GF(q), where q = A246655(n) is the n-th prime power > 1.

Maximal number of rational points on a curve of genus 2 over GF(q), where q = A246655(n) is the n-th prime power > 1.

Maximal number of rational points that a (smooth, geometrically irreducible) curve of genus 3 over the finite field GF(q) can have, where q is the n-th prime power >= 2.

Maximal number of rational points on a curve of genus n over GF(2).

Størmer numbers or arc-cotangent irreducible numbers: numbers k such that the largest prime factor of k^2 + 1 is >= 2*k.

Primitive prime factors of the sequence k^2 + 1 (A002522) in the order that they are found.

Number of Boolean functions of n variables from Post class F(8,inf); number of degenerate Boolean functions of n variables.

Decimal expansion of fifth root of 2.

Decimal expansion of fifth root of 3.

Decimal expansion of fifth root of 4.

Decimal expansion of fifth root of 5.

Number of semi-regular digraphs (with loops) on n unlabeled nodes with each node having out-degree 3.

a(0) = 0; thereafter a(2n) = n - a(n) - a(n-1), a(2n+1) = n - 2a(n) + 1.

Numbers m such that 4*3^m + 1 is prime.

Numbers n such that 8*3^n + 1 is prime.

Numbers k such that 10*3^k + 1 is prime.

Numbers k such that 4*3^k - 1 is prime.

Numbers k such that 8*3^k - 1 is prime.

Numbers k such that 10*3^k - 1 is prime.

Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (0,2,2).

Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (1,1,2).

Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (0,1,3).

Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (0,3,3).

Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (1,2,3).

Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (2,2,2).

Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,3).

Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (1,2).

Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,4).

Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (1,3).

Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (2,2).

Sums of successive Motzkin numbers.

A finite sequence associated with the Lie algebra E_8.

Exponents m_i associated with Weyl group W(E6).

a(n) is the number of Dyck paths of semilength n+6 having its first peak at height n+1.

a(n) is the number of n-step walks on square lattice such that 0 <= y <= x at each step.

Number of walks on square lattice. Column y=1 of A052174.