Summary of block A268
Sequences in block A268
Section titled “Sequences in block A268”-
A268021: a(1) = a(2) = 1; if n > 2 then a(n) = a(n-1)*a(n-2) - a(n-2) - a(n-1).
-
A268044: The odd numbers congruent to {3, 4} mod 5.
-
A268085: a(n) = Catalan(n)^2*n.
-
A268093: Number of 1 X n 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.
-
A268099: a(n) = 2^(n mod 2)*5*10^floor(n/2) - 1.
-
A268100: a(n) = 2^((n-1) mod 2)*5*10^floor((n-1)/2).
-
A268147: A double binomial sum involving absolute values.
-
A268148: A double binomial sum involving absolute values.
-
A268149: A double binomial sum involving absolute values.
-
A268196: a(n) = Product_{k=0..n} binomial(3*k,k).
-
A268201: a(n) = 4*n^3 - 6*n^2 + 3*n - 1.
-
A268210: Primes p of the form 2^k + 1 such that p - k is a prime q (for k >= 0).
-
A268226: Complement of A056991.
-
A268262: Number of length-(3+1) 0..n arrays with new repeated values introduced in sequential order starting with zero.
-
A268291: a(n) = Sum_{k = 0..n} (k mod 13).
-
A268344: a(n) = 11*a(n - 1) - 3*a(n - 2) for n>1, a(0)=0, a(1)=1.
-
A268351: a(n) = 3*n*(9*n - 1)/2.
-
A268363: Number of n X 2 arrays containing 2 copies of 0..n-1 with row sums equal.
-
A268413: a(n) = Sum_{k = 0..n} (-1)^k*14^k.
-
A268414: a(n) = 5*a(n-1) - 2*n for n > 0, a(0) = 1.
-
A268458: Number of length-4 0..n arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.
-
A268484: a(n) = (n + 1)*(4*n^2 + 14*n + 9)/3.
-
A268504: a(n) = Product_{k=0..n} (3*k)!.
-
A268505: a(n) = Product_{k=0..n} (4*k)!.
-
A268506: a(n) = Product_{k=0..n} (5*k)!.
-
A268539: Numbers k such that 48*k + 25 is a perfect square.
-
A268581: a(n) = 2*n^2 + 8*n + 5.
-
A268613: Lucas numbers mod 20.
-
A268633: Number of n X 2 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totalling two exactly once.
-
A268644: a(n) = 4*n^3 - 3*n^2 - 2*n - 1.
-
A268676: a(n) = A101080(n,A268823(3+n)), where A101080(x,y) gives the Hamming distance between binary expansions of x and y.
-
A268684: a(n) = n*(n + 1)*(4*n - 1)/3.
-
A268741: a(n) = 2*a(n - 2) - a(n - 1) for n>1, a(0) = 4, a(1) = 5.
-
A268744: Number of n X 2 binary arrays with some element plus some horizontally or vertically adjacent neighbor totalling two no more than once.
-
A268775: Number of n X 2 binary arrays with some element plus some horizontally, vertically, diagonally or antidiagonally adjacent neighbor totalling two no more than once.
-
A268810: a(n) = 2*floor(3*n*(n+1)/4).
-
A268839: a(n) = Sum_{j=1..10^n-1} 2^f(j) where f(j) is the number of zero digits in the decimal representation of j.
-
A268898: Number of n X 2 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.
-
A268899: Number of n X 3 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two exactly once.
-
A268945: Number of length-4 0..n arrays with no repeated value unequal to the previous repeated value plus one mod n+1.
-
A268965: Number of n X 2 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.
-
A268966: Number of n X 3 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.