Sequences

Number of Boolean functions realized by cascades of n gates.

Number of Boolean functions realized by cascades of n gates.

Number of Boolean functions of n variables that are variously called "unate cascades" or "1-decision list functions" or "read-once threshold functions".

Cascade-realizable Boolean functions of n variables.

The binary complement of the infinite Fibonacci word A003849. Start with 1, apply 0->1, 1->10, iterate, take limit.

Number of non-degenerate fanout-free Boolean functions of n variables using And, Or, Not and Majority gates.

Number of non-degenerate disjunctively-realizable functions of n variables.

Number of non-degenerate fanout-free Boolean functions of n variables using And, Or, Xor, Not, and Majority gates.

a(n) = 6*a(n-1) - 8.

Number of Boolean functions realized by n-input cascades.

Spiral sieve using Fibonacci numbers.

Spiral sieve using Fibonacci numbers.

Spiral sieve using Fibonacci numbers.

Spiral sieve using Fibonacci numbers.

Spiral sieve using Fibonacci numbers.

Spiral sieve using Fibonacci numbers.

Spiral sieve using Fibonacci numbers.

Number of achiral planted trees with n nodes.

Number of chiral planted trees with n nodes.

Number of achiral trees with n nodes.

Number of chiral trees with n nodes.

Bishops on a 2n+1 X 2n+1 board (see Robinson paper for details).

Bishops on a 2n+1 X 2n+1 board (see Robinson paper for details).

Bishops on an n X n board (see Robinson paper for details).

Bishops on an n X n board (see Robinson paper for details).

Number of ways of placing n non-attacking bishops on an n X n board so that every square is attacked (or occupied).

Number of n-node connected graphs without points of degree 2.

Number of n-node graphs without nodes of degree 2.

Number of unlabeled trivalent (or cubic) graphs with 2n nodes.

Number of self-converse oriented graphs with n nodes.

Number of phylogenetic trees with n labels.

Number of 2-diregular digraphs with n nodes.

Number of 2-diregular connected digraphs with n nodes.

Number of labeled irreducible 2-connected graphs with n edges.

Number of labeled 3-connected graphs with n nodes.

Number of sensed 3-connected planar maps with n edges.

Number of classifications of n elements.

Salié numbers.

Number of 2n-bead black-white reversible necklaces with n black beads.

Expansion of e.g.f. (2 - e^x)^(-2).

Number of "magic squares" of order n (see comment line for exact definition).

Sum of multinomial coefficients (n_1+n_2+...)!/(n_1!*n_2!*...) where (n_1, n_2, ...) runs over all integer partitions of n.

Lexicographically least increasing sequence, starting with 1, such that the sum of 2 distinct terms is never a Fibonacci number.

Lexicographically least increasing sequence, starting with 2, such that the sum of two distinct terms of the sequence is never a Fibonacci number.

Number of bracelets (turn over necklaces) with n red, 1 pink and n-1 blue beads; also reversible strings with n red and n-1 blue beads; also next-to-central column in Losanitsch's triangle A034851.

Number of board configurations in Mu Torere (for one player).

Number of bracelets (turn over necklaces) with n red, 1 pink and n - 3 blue beads; also reversible strings with n red and n-3 blue beads.

a(n) = floor( tan(n)^2 ).

If n appears so do 2n, 3n+2, 6n+3.

If k appears so do 2k-2 and 3k-3. (duplicates omitted.)