Skip to content

Summary of block A286

42 sequences
  • A286033: a(n) = binomial(2*n-2, n-1) + (-1)^n.

  • A286063: Fixed point of the mapping 00->001, 1->100, starting with 00.

  • A286184: Number of connected induced (non-null) subgraphs of the helm graph with 2n+1 nodes.

  • A286186: Number of connected induced (non-null) subgraphs of the friendship graph with 2n+1 nodes.

  • A286191: a(n) = (2^n-1)^2 + 2*n.

  • A286230: Possible differences between consecutive primes p, q satisfying p! == 1 (mod q).

  • A286264: a(n) = 2*(ceiling((n^2)/2)+1) - 1.

  • A286282: Stage at which Ken Knowlton’s elevator (version 2) reaches floor n for the first time.

  • A286283: a(n) = floor(7*n^2/48).

  • A286286: a(0) = 0; thereafter, a(n) = (2*n-1)*a(n-1) + 1.

  • A286311: a(n) = 2*a(n-1) - a(n-2) + a(n-4), n>3, a(0)=0, a(1)=a(2)=1, a(3)=3.

  • A286350: a(n) = 2*a(n-1) - a(n-2) + a(n-4) for n>3, a(0)=0, a(1)=a(2)=2, a(3)=3.

  • A286437: Number of ways to tile an n X n X n triangular area with two 2 X 2 X 2 triangular tiles and an appropriate number (= n^2-8) of 1 X 1 X 1 tiles.

  • A286444: Number of non-equivalent ways to tile an n X n X n triangular area with two 2 X 2 X 2 triangular tiles and an appropriate number (= n^2-8) of 1 X 1 X 1 tiles.

  • A286507: Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 190”, based on the 5-celled von Neumann neighborhood.

  • A286508: Binary representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 190”, based on the 5-celled von Neumann neighborhood.

  • A286521: Decimal representation of the diagonal from the origin to the corner (or of the corner to the origin) of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 659”, based on the 5-celled von Neumann neighborhood.

  • A286666: Positions of 0 in A286665; complement of A286667.

  • A286667: Positions of 1 in A286665; complement of A286666.

  • A286690: Positions of 1 in A286688; complement of A286689.

  • A286716: a(n) = floor(n/2) - floor((n+1)/5), n >= 0.

  • A286717: a(n) is the number of zeros of the Chebyshev S(n, x) polynomial (A049310) in the open interval (-phi, +phi), with the golden section phi = (1 + sqrt(5))/2.

  • A286725: Third column of triangle A286724: Lah[2,1](n+2, 2), n >= 0.

  • A286727: Positions of 0 in A286063; complement of A286728.

  • A286728: Positions of 1 in A286063; complement of A286727.

  • A286750: Positions of 0 in A286749; complement of A286751.

  • A286752: {010010->null}-transform of the infinite Fibonacci word A003849.

  • A286753: Positions of 0 in A286752; complement of A286753.

  • A286754: Positions of 1 in A286752; complement of A286753.

  • A286773: Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 221”, based on the 5-celled von Neumann neighborhood.

  • A286778: Sum of the common path length over all 2-tuples of nodes in a complete binary tree of height n.

  • A286809: Positions of 1 in A286807; complement of A286808.

  • A286810: Number of non-attacking bishop positions on a cylindrical 2 X 2n chessboard.

  • A286812: a(n) = 105 - 2^n.

  • A286814: Number of matchings in the n-helm graph.

  • A286904: Positions of 0 in A286903; complement of A286905.

  • A286905: Positions of 1 in A286903; complement of A286904.

  • A286909: Positions of 1 in A286907; complement of A286908.

  • A286923: Positions of 0 in A286922; complement of A286924.

  • A286927: Positions of 1 in A286925; complement of A286926.

  • A286930: Integers whose double is a square and whose triple is a cube.

  • A286983: a(n) is the smallest integer that can appear as the n-th term of two distinct nondecreasing sequences of positive integers that satisfy the Fibonacci recurrence relation.