Skip to content

Summary of block A204

67 sequences
  • A204089: The number of 1 by n Haunted Mirror Maze puzzles with a unique solution ending with a mirror, where mirror orientation is fixed.

  • A204090: The number of 1 X n Haunted Mirror Maze puzzles with a unique solution where mirror orientation is fixed.

  • A204091: The number of 1 X n Haunted Mirror Maze puzzles with a unique solution ending with a mirror.

  • A204092: The number of 1 by n Haunted Mirror Maze puzzles with a unique solution.

  • A204164: Symmetric matrix based on f(i,j) = floor((i+j)/2), by antidiagonals.

  • A204166: Symmetric matrix based on f(i,j)=ceiling[(i+j)/2], by antidiagonals.

  • A204171: Symmetric matrix based on f(i,j)=(1 if max(i,j) is odd, and 0 otherwise), by antidiagonals.

  • A204175: Symmetric matrix based on f(i,j)=(1 if max(i,j) is even, and 0 otherwise), by antidiagonals.

  • A204200: INVERT transform of [1, 0, 1, 3, 9, 27, 81, …].

  • A204253: Symmetric matrix given by f(i,j)=1+[(i+j) mod 3].

  • A204255: Symmetric matrix given by f(i,j)=1+[(i+j) mod 4].

  • A204257: Matrix given by f(i,j)=1+[(i+2j) mod 3], by antidiagonals.

  • A204259: Matrix given by f(i,j) = 1 + [(2i+j) mod 3], by antidiagonals.

  • A204263: Symmetric matrix: f(i,j)=(i+j mod 3), by antidiagonals.

  • A204267: Symmetric matrix: f(i,j)=(i+j+1 mod 3), by antidiagonals.

  • A204269: Symmetric matrix: f(i,j)=floor[(i+j+2)/4]-floor[(i+j)/4], by (constant) antidiagonals.

  • A204321: Start with 4. Square the previous term and subtract it.

  • A204326: Number of cubic graphs on 2n nodes with chromatic number 3.

  • A204327: a(n) = Pell(n^2).

  • A204399: Numbers k such that floor(2^k / 3^n) = 1.

  • A204418: Periodic sequence 1,0,1,…, arranged in a triangle.

  • A204421: Symmetric matrix: f(i,j)=(i+j+2 mod 3), by antidiagonals.

  • A204423: Infinite matrix: f(i,j)=(2i+j mod 3), by antidiagonals.

  • A204425: Infinite matrix: f(i,j)=(2i+j+1 mod 3), by antidiagonals.

  • A204427: Infinite matrix: f(i,j)=(2i+j+2 mod 3), read by antidiagonals.

  • A204429: Symmetric matrix: f(i,j)=(2*i + 2*j) mod 3, by antidiagonals.

  • A204431: Symmetric matrix: f(i,j)=(2i+j+1 mod 3), by antidiagonals.

  • A204433: Symmetric matrix: f(i,j) = (2*i + 2*j + 2) mod 3, by antidiagonals.

  • A204435: Symmetric matrix: f(i,j)=((i+j)^2 mod 3), read by (constant) antidiagonals.

  • A204437: Symmetric matrix: f(i,j)=((i+j+1)^2 mod 3), by (constant) antidiagonals.

  • A204439: Symmetric matrix: f(i,j)=((i+j+2)^2 mod 3), by (constant) antidiagonals.

  • A204443: Symmetric matrix: f(i,j)=floor[(i+j+3)/4]-floor[(i+j)/4], by (constant) antidiagonals.

  • A204445: Symmetric matrix: f(i,j)=floor[(i+j+4)/4]-floor[(i+j+1)/4], by (constant) antidiagonals.

  • A204454: Odd numbers not divisible by 11.

  • A204457: Odd numbers not divisible by 13.

  • A204458: Odd numbers not divisible by 17.

  • A204467: Number of 3-element subsets that can be chosen from {1,2,…,6*n+3} having element sum 9*n+6.

  • A204502: Numbers such that floor[a(n)^2 / 9] is a square.

  • A204515: a(n) = (2*n)! * (2*n+1)! / ((n+1)^2 * n!^3).

  • A204544: Fractional part of (3/2)^n without the decimal point.

  • A204545: Symmetric matrix: f(i,j)=floor[(i+j+3)/4]-floor[(i+j+1)/4], by (constant) antidiagonals.

  • A204547: Symmetric matrix: f(i,j)=floor[(i+j+4)/4]-floor[(i+j+2)/4], by (constant) antidiagonals.

  • A204549: Symmetric matrix: f(i,j)=floor[(i+j+5)/4]-floor[(i+j+3)/4], by (constant) antidiagonals.

  • A204551: Symmetric matrix: f(i,j)=floor[(2i+2j+1)/4]-floor[(i+j)/4], by (constant) antidiagonals.

  • A204553: Symmetric matrix: f(i,j)=floor[(2i+2j+2)/4]-floor[(i+j+1)/4], by (constant) antidiagonals.

  • A204557: Right edge of the triangle A045975.

  • A204558: Row sums of the triangle A045975.

  • A204560: Symmetric matrix: f(i,j)=floor[(2i+2j+4)/4]-floor[(i+j+2)/4], by (constant) antidiagonals.

  • A204562: Symmetric matrix: f(i,j) = floor((2i+2j+6)/4)-floor((i+j+3)/4), by (constant) antidiagonals.

  • A204565: Number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order.

  • A204623: Number of (n+1)X2 0..2 arrays with every 2X2 subblock having unequal diagonal elements or unequal antidiagonal elements, and new values 0..2 introduced in row major order.

  • A204644: Number of (n+1) X 2 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.

  • A204671: a(n) = n^n (mod 6).

  • A204674: a(n) = 4*n^3 + 5*n^2 + 2*n + 1.

  • A204675: a(n) = 16*n^2 + 2*n + 1.

  • A204687: a(n) = A204321(n)/4.

  • A204688: a(n) = n^n (mod 3).

  • A204689: a(n) = n^n (mod 4).

  • A204690: n^n (mod 5).

  • A204693: a(n) = n^n (mod 7).

  • A204694: a(n) = n^n (mod 8).

  • A204695: a(n) = n^n (mod 9).

  • A204707: Number of (n+1) X 3 0..1 arrays with the permanents of all 2 X 2 subblocks equal and nonzero.

  • A204708: Number of (n+1) X 4 0..1 arrays with the permanents of all 2 X 2 subblocks equal and nonzero.

  • A204841: (2n)! - 2^n*n!.

  • A204897: a(n) = (p(n)-q(n))/n, where (p(n), q(n)) is the least pair of primes for which n divides p(n)-q(n).

  • A204904: p(n)-q(n), where (p(n), q(n)) is the least pair of odd primes for which n divides p(n)-q(n).