Summary of block A263
Sequences in block A263
Section titled “Sequences in block A263”-
A263013: a(0) = -a(1) = a(2) = 1, a(n) = 0 for n>2.
-
A263053: Number of (n+1) X 2 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.
-
A263200: Number of perfect matchings on a Möbius strip of width 3 and length 2n.
-
A263226: a(n) = 15*n^2 - 13*n.
-
A263228: a(n) = 2*n*(16*n - 13).
-
A263231: a(n) = n*(25*n - 39)/2.
-
A263394: a(n) = Product_{i=1..n} (3^i - 2^i).
-
A263416: a(n) = Product_{k=0..n} (3*k+1)^(n-k).
-
A263417: a(n) = Product_{k=0..n} (3*k+2)^(n-k).
-
A263426: Permutation of the nonnegative integers: [4k+2, 4k+1, 4k, 4k+3, …].
-
A263429: Smallest prime p such that binomial(2*p-1, p-1) == 1 (mod p^n), or 0 if no such p exists.
-
A263430: a(n) = Product_{k=0..n} (4*k+1)^(n-k).
-
A263449: Permutation of the natural numbers: [4k+1, 4k+4, 4k+3, 4k+2, …].
-
A263465: Values of D for which the imaginary quadratic field Q[ sqrt(-D) ] is norm-Euclidean.
-
A263467: Indices of Fibonacci primes equal to a sum of squares of two Fibonacci numbers at least one of which is also prime.
-
A263511: Total number of ON (black) cells after n iterations of the “Rule 155” elementary cellular automaton starting with a single ON (black) cell.
-
A263574: Beatty sequence for 1/sqrt(3) - log(phi)/3575 where phi is the golden ratio, A001622.
-
A263621: Appears to be an erroneous version of A263620.
-
A263622: a(n) = (3^(n+1)-2^(n+2)+2*n+1)/4.
-
A263623: a(1)=1; thereafter, a(n) = smallest k such that the decimal concatenation [a(n-2)+1 a(n-2)+2, … a(n-1)] divides the decimal concatenation [a(n-1)+1 a(n-1)+2 … k].
-
A263689: a(n) = (2*n^6 - 6*n^5 + 5*n^4 - n^2 + 12)/12.
-
A263766: a(n) = Product_{k=1..n} (k^2 - 2).
-
A263772: Perimeters of integer-sided scalene triangles.
-
A263794: Number of (n+1) X (3+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits, and rows and columns lexicographically nonincreasing.
-
A263800: Numbers n such that there is some field with u-invariant n.
-
A263801: Partial sums of odd double factorials (A001147) with alternating signs.
-
A263807: Total number of ON (black) cells after n iterations of the “Rule 157” elementary cellular automaton starting with a single ON (black) cell.
-
A263823: a(n) = n!*Sum_{k=0..n} Fibonacci(k-1)/k!, where Fibonacci(-1) = 1, Fibonacci(n) = A000045(n) for n>=0.
-
A263824: Permutation of the nonnegative integers: [6k+3, 6k+4, 6k+5, 6k, 6k+1, 6k+2, …].
-
A263842: Maximal Hamming distance of a doubly-even self-dual code of length 4n over GF(4).
-
A263878: a(n) = Sum_{k=0..n} (-1)^k*k*Fibonacci(k), where Fibonacci(k) = A000045(k).
-
A263881: Numbers k such that k! is a “compact factorial”, i.e., k! is in A169661.
-
A263941: Minimal most likely sum for a roll of n 8-sided dice.
-
A263942: Positive integers n such that (n+4)^3 - n^3 is a square.
-
A263986: Difference between Catalan numbers and Fibonacci numbers: a(n) = C(n) - F(n).
-
A263997: Sequence of block lengths in a block spiral of width 1.