Summary of block A221
Sequences in block A221
Section titled “Sequences in block A221”-
A221082: Number of n X 3 arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor.
-
A221088: Number of 2 X n arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor.
-
A221130: a(n) = 2^(2*n - 1) + n.
-
A221158: Fibonacci numbers with two 1’s in the binary representation.
-
A221160: G.f.: Sum_{n>=0} (4*n+1)^n * x^n / (1 + (4*n+1)*x)^n.
-
A221172: a(0)=-2, a(1)=3; thereafter a(n) = 2*a(n-1) + a(n-2).
-
A221211: Numbers n such that n and n + 4 are prime and there is a power of two in the interval (n,n+4).
-
A221364: The simple continued fraction expansion of F(x) := Product_{n >= 0} (1 - x^(4*n+3))/(1 - x^(4*n+1)) when x = 1/2*(3 - sqrt(5)).
-
A221366: The simple continued fraction expansion of F(x) := Product_{n >= 0} (1 - x^(4*n+3))/(1 - x^(4*n+1)) when x = (1/2)*(7 - 3*sqrt(5)).
-
A221374: Number of n X 2 arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, with no occupancy greater than 2.
-
A221414: Number of nX3 arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, with every occupancy equal to zero or two.
-
A221461: Number of 0..6 arrays of length n with each element unequal to at least one neighbor, starting with 0.
-
A221462: Number of 0..7 arrays of length n with each element unequal to at least one neighbor, starting with 0.
-
A221464: Number of 0..n arrays of length 5 with each element unequal to at least one neighbor, starting with 0.
-
A221465: Number of 0..n arrays of length 6 with each element unequal to at least one neighbor, starting with 0.
-
A221466: Number of 0..n arrays of length 7 with each element unequal to at least one neighbor, starting with 0.
-
A221574: Number of 0..n arrays of length 3 with each element differing from at least one neighbor by something other than 1.
-
A221719: a(n) = 3*2^n - Fibonacci(n+3) - 1.
-
A221731: Number of n X 2 arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, without move-in move-out left turns.
-
A221829: Number of 2 X n arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without 2-loops or left turns.
-
A221855: Number of cyclotomic cosets of 13 mod 10^n.
-
A221874: Numbers m such that 10*m^2 + 6 is a square.
-
A221882: Number of order-preserving or order-reversing full contraction mappings of an n-chain.
-
A221904: a(n) = 9^n + 10^n.
-
A221905: a(n) = 3^n + 3*n.
-
A221906: a(n) = 4^n + 4*n.
-
A221907: a(n) = 5^n + 5*n.
-
A221908: a(n) = 6^n + 6*n.
-
A221909: a(n) = 7^n + 7*n.
-
A221910: a(n) = 8^n + 8*n.
-
A221911: a(n) = 9^n + 9*n.
-
A221912: Partial sums of floor(n/12).
-
A221953: a(n) = 5^(n-1) * n! * Catalan(n-1).
-
A221954: a(n) = 3^(n-1) * n! * Catalan(n-1).
-
A221955: a(n) = 6^(n-1) * n! * Catalan(n-1).
-
A221957: Number of n X n rook placements avoiding the pattern 012.