Skip to content

Summary of block A264

28 sequences
  • A264038: Convolution of Lucas and Jacobsthal numbers.

  • A264040: Number of possible permutations of the n X n generalization of the sliding block 15-puzzle.

  • A264041: a(n) is the maximum number of diagonals that can be placed in an n X n grid made up of 1 X 1 unit squares when diagonals are placed in the unit squares in such a way that no two diagonals may cross or intersect at an endpoint.

  • A264080: a(n) = 6*F(n)*F(n+1) + (-1)^n, where F = A000045.

  • A264120: Values of k such that A001163(k) is positive.

  • A264147: a(n) = n*F(n+1) - (n+1)*F(n), where F = A000045.

  • A264152: a(n) = (2^floor(n+n/2)/sqrt(Pi)^mod(n+1,2))*Gamma(n+1/2)/Gamma(n/2+1).

  • A264153: a(n) = ((2*n)!)^2 / 2^n.

  • A264200: Numerator of sum of numbers in set g(n) generated as in Comments.

  • A264443: a(n) = n*(n + 5)*(n + 10)/6.

  • A264557: Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 3.

  • A264635: Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4.

  • A264656: Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 5.

  • A264701: Number of n X 1 arrays of permutations of 0..n-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 6.

  • A264763: a(0) = a(1) = 1; for n>1, a(n) = a(n-1) + (a(n-2) mod 5).

  • A264788: a(n) is the number of circles added at n-th iteration of the pattern starting with 2 circles. (See comment.)

  • A264791: Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 7.

  • A264800: Nearly-Fibonacci sequence.

  • A264851: a(n) = n*(n + 1)*(n + 2)*(4*n - 3)/6.

  • A264889: Partial sums of hyperfactorials (A002109).

  • A264891: a(n) = n*(5*n - 3)*(25*n^2 - 15*n - 6)/8.

  • A264892: a(n) = n*(3*n - 2)*(9*n^2 - 6*n - 2).

  • A264894: a(n) = n*(7*n - 5)*(49*n^2 - 35*n - 10)/8.

  • A264895: a(n) = n*(4*n - 3)*(16*n^2 - 12*n - 3).

  • A264929: a(n)= ackb(n,3) where ackb is the Ackermann-Burnell function.

  • A264931: a(n) = 1+2*3^4…[n-1]n where [n] is the n-th hyperoperator.

  • A264932: a(1) = 1, a(2) = 3, a(n)= H_4(a(n-1),a(n-2)).

  • A264938: a(n) = n*(2*n-1) + floor(n/3).