Sequences

Reverse and Add! sequence starting with 196.

Number of mappings from n points to themselves with in-degree <= 2.

Supersingular primes of the elliptic curve X_0 (11).

Number of planar embedded labeled trees with n nodes: (2*n-3)!/(n-1)! for n >= 2, a(1) = 1.

Number of directed rooted trees with n nodes.

Number of directed trees with n nodes.

Number of lattices on n unlabeled nodes.

Number of graceful permutations of length n.

Number of letters in Roman numeral representation of n.

Number of characters in French ordinal numbers.

Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).

Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).

Lucas-Carmichael numbers: squarefree composite numbers k such that p | k => p+1 | k+1.

Dimensions of representations by Witt vectors.

Coefficients of Chebyshev T polynomials: a(n) = A053120(n+8, n), n >= 0.

Negated coefficients of Chebyshev T polynomials: a(n) = -A053120(n+10, n), n >= 0.

Coefficients of Chebyshev T polynomials: a(n) = A053120(n+12, n), n >= 0.

Cellular automaton with Rule 230: 000, 001, 010, 011, ..., 111 -> 0,1,1,0,0,1,1,1.

Successive states of the Rule 110 cellular automaton defined by 000, 001, 010, 011, ..., 111 -> 0,1,1,1,0,1,1,0 when started with a single ON cell.

a(n) is the number of compositions of n in which the maximum part size is 5.

Compositions: 6th column of A048004.

a(n) is the number of unlabeled modular lattices on n nodes.

Number of unlabeled distributive lattices on n nodes.

Number of simple perfect squared squares of order n up to symmetry.

Greatest minimal norm of sublattice of index n in hexagonal lattice.

Fibonacci tower: a(n) = F(a(n-1)+2) (there is no room for next term).

Erroneous version of A038119.

Binomial coefficients: C(n,k), 2 <= k <= n-2, sorted, duplicates removed.

a(n) = (10^n)-th prime.

Log of g.f. of numbers of preferential arrangements.

Largest prime <= n!.

Primitive congruent numbers.

Bertrand primes: a(n) is largest prime < 2*a(n-1) for n > 1, with a(1) = 2.

n! in base n.

Number of letters in n (in Russian).

Binary palindromes: numbers whose binary expansion is palindromic.

a(n) = C(2n,n) mod 3.

Partitioning integers to avoid arithmetic progressions of length 3.

Partitioning integers to avoid arithmetic progressions of length 3.

Partitioning integers to avoid arithmetic progressions of length 3.

Number of partitions of n into Fibonacci parts (with 2 types of 1).

Trajectory of 1 under the morphism 1 -> 12, 2 -> 123, 3 -> 1234, etc.

Sum of degrees of irreducible representations of alternating group A_n.

Euler transform of numbers of preferential arrangements.

a(n) = (3*n)! / ((n+1)*(n!)^3).

Number of characters in the French spelling of n, including spaces and hyphens.

Number of edges in graph of maximal intersecting families of sets.

Valence of graph of maximal intersecting families of sets.

Chvatal conjecture for radius of graph of maximal intersecting sets.

Number of 3-voter voting schemes with n linearly ranked choices.