Sequences

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

k in S implies 2k-2, 3k-3 in S.

Start with 4; if k appears then so do 2k+2 and 3k+3. (duplicates omitted.)

Numerators of convergents to log_2(3) = log(3)/log(2).

Denominators of convergents to log_2 3.

Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg one step away.

Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg two steps away.

Numerators of continued fraction convergents to sqrt(10).

Denominators of continued fraction convergents to sqrt(10).

Indices of primes where largest gap occurs.

Mrs. Perkins's quilt: smallest coprime dissection of n X n square.

Nearest integer to tan(n)^2.

a(n) = Fibonacci(n+1) - 2^floor(n/2).

a(n) = F(n+2) - 2^[ (n+1)/2 ] - 2^[ n/2 ] + 1.

a(n) = 2^(n-1) + 2^[ n/2 ] + 2^[ (n-1)/2 ] - F(n+3).

Deficit in peeling rinds.

a(n) = Sum_{k=0..n} C(n-k,4*k).

Maximal size of equidistant permutation array R(n,1).

A squarefree ternary sequence.

A squarefree (or Thue-Morse) ternary sequence: closed under a->abc, b->ac, c->b.

A squarefree ternary sequence.

A squarefree quaternary sequence.

Number of Twopins positions.

Numbers of Twopins positions.

Number of Twopins positions.

Number of Twopins positions.

Number of Twopins positions.

Number of Twopins positions.

Numbers of Twopins positions.

Number of Twopins positions.

Number of Twopins positions.

Number of Twopins positions.

Shortest wins at Beanstalk.

Erroneous version of A321442.

Positions of remoteness 6 in Beans-Don't-Talk.

Positions of remoteness 3 in Beans-Don't-Talk.

Positions of remoteness 4 in Beans-Don't-Talk.

Positions of remoteness 5 in Beans-Don't-Talk.

Positions of remoteness 2 in Beans-Don't-Talk.

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

a(n) = C(n)*C(n+2) - C(n+1)^2 where C() are the Catalan numbers A000108.

Number of exterior points formed by extending diagonals of n-gon in general position.

Number of sesquirotational Kotzig factorizations.

Number of n-node connected graphs with at most one cycle.

Number of partitions of 3n into powers of 3.

Number of partitions of 4*n into powers of 4.

Number of partitions of 5n into powers of 5.

a(1) = a(2) = a(3) = a(4) = 1, a(n) = a(a(n-1))+a(n-a(n-1)) for n >= 5.

a(n) = a(n-1) + a(n-6), with a(i) = 1 for i = 0..5.

a(n) = a(n-1) + a(n-7), with a(i) = 1 for i = 0..6.