Summary of block A206
Sequences in block A206
Section titled “Sequences in block A206”-
A206332: Complement of A092754.
-
A206344: a(n) = floor(n/2)^n.
-
A206351: a(n) = 7*a(n-1) - a(n-2) - 4 with a(1)=1, a(2)=3.
-
A206371: a(n) = 31*2^n + 1.
-
A206372: a(n) = 14 * 4^n - 1.
-
A206373: a(n) = (14*4^n + 1)/3.
-
A206374: a(n) = (7*4^n - 1)/3.
-
A206399: a(0) = 1; for n > 0, a(n) = 41*n^2 + 2.
-
A206417: (5*F(n)+3*L(n)-8)/2.
-
A206444: Least n such that L(n)<-1 and L(n)<L(n-1), where L(k) means the least root of the polynomial p(k,x) defined at A206284, and a(1)=13.
-
A206456: Number of 0..n arrays of length n+2 avoiding the consecutive pattern 0..n.
-
A206543: Period 10: repeat 1, 3, 5, 7, 9, 9, 7, 5, 3, 1.
-
A206565: Expansion of 1/(1 - 37*x + x^2).
-
A206601: 3^(n(n+1)/2) - 1.
-
A206609: Fibonacci sequence beginning 13, 9.
-
A206687: Number of n X 2 0..3 arrays with no element equal to another within two positions in the same row or column, and new values 0..3 introduced in row major order.
-
A206723: a(n) = 7*( ((3 + sqrt(5))/2)^n + ((3 - sqrt(5))/2)^n - 2 ).
-
A206776: a(n) = 3*a(n-1) + 2*a(n-2) for n>1, a(0)=2, a(1)=3.
-
A206807: Position of 3^n when {2^j} and {3^k} are jointly ranked; complement of A206805.
-
A206816: a(n) = Sum_{0<j<n} (n!-j!).
-
A206905: n+[nr/t]+[ns/t], where []=floor, r=3, s=sqrt(3), t=1/s.
-
A206912: Position of log(n+1) when the partial sums of the harmonic series are jointly ranked with the set {log(k+1)}; complement of A206911.
-
A206917: Sum of binary palindromes in the half-open interval [2^(n-1), 2^n).
-
A206918: Sum of binary palindromes p < 2^n.
-
A206927: Minimal numbers of binary length n+1 such that the number of contiguous palindromic bit patterns in the binary representation is minimal.
-
A206981: Number of n X 2 0..1 arrays avoiding the patterns 0 1 0 or 1 0 1 in any row, column, diagonal or antidiagonal.