Skip to content

Summary of block A247

43 sequences
  • A247014: Number of binary centrosymmetric matrices of size n X n.

  • A247018: Numbers of the form 3*z^2 + z + 3 for some integer z.

  • A247049: Rectangular array read upwards by columns: T = T(n,k) = number of paths from (0,0) to (n,k), where 0 >= k <= 2, consisting of segments given by the vectors (1,1), (1,2), (1,-1).

  • A247061: Dynamic Betting Game D(n,5,1).

  • A247062: Dynamic Betting Game D(n,5,2).

  • A247063: Dynamic Betting Game D(n,5,3).

  • A247064: Dynamic Betting Game D(n,5,4).

  • A247112: Floor of sums of the cubes of the non-integer square roots of n, as partitioned by the integer roots: floor(Sum_{j=n^2+1..(n+1)^2-1} j^(3/2)).

  • A247128: Positive numbers that are congruent to {0,5,9,13,17} mod 22.

  • A247157: Greatest number of colors possible for interval edge-colorings of the complete graph K_{2n}.

  • A247160: Dynamic Betting Game D(n,4,3).

  • A247188: a(0) = 0. a(n) is the number of repeating sums in the collection of all sums of any k elements in [a(0), … a(n-1)] chosen without replacement for 2 <= k <= n.

  • A247207: 4^(2^n) + 3^(2^n) + 2^(2^n) + 1.

  • A247215: Integers k such that 3k+1 and 6k+1 are both squares.

  • A247281: a(n) = 4^n -(-1)^n.

  • A247309: Rectangular array read upwards by columns: T = T(n,k) = number of paths from (0,1) to (n,k), where 0 <= k <= 2, consisting of segments given by the vectors (1,1), (1,0), (1,-1), (1,-2).

  • A247313: a(n) = 5*a(n-1) - 2^n for n>0, a(0)=1.

  • A247334: Highly abundant numbers which are not abundant.

  • A247335: The curvature of touching circles inscribed in a special way in the larger segment of circle of radius 10/9 divided by a chord of length 4/3.

  • A247375: Numbers m such that floor(m/2) is a square.

  • A247425: A005206(A003259(n)).

  • A247426: Complement of A247425.

  • A247431: The largest integer m such that A001950(m) < A003231(n).

  • A247432: Complement of A247431.

  • A247525: a(n) = 5 * a(n-1) - 2 * a(n-1)^2 / a(n-2), with a(0) = 1, a(1) = 2.

  • A247541: a(n) = 7*n^2 + 1.

  • A247560: a(n) = 3*a(n-1) - 4*a(n-2) with a(0) = a(1) = 1.

  • A247563: a(n) = 3*a(n-1) - 4*a(n-2) with a(0) = 2, a(1) = 3.

  • A247565: a(n) = 5*a(n-1) - 10*a(n-2) + 8*a(n-3) with a(0) = 2, a(1) = a(2) = 3.

  • A247618: Start with a single square; at n-th generation add a square at each expandable vertex; a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)

  • A247620: Start with a single hexagon; at n-th generation add a hexagon at each expandable vertex; a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)

  • A247643: a(n) = ( 10*n*(n+1)+(2*n+1)*(-1)^n+7 )/8.

  • A247727: Number of length 1+3 0..n arrays with no disjoint pairs in any consecutive four terms having the same sum.

  • A247792: a(n) = 9*n^2 + 1.

  • A247817: Sum(4^k, k=2..n).

  • A247840: a(n) = Sum_{k=2..n} 6^k.

  • A247841: a(n) = Sum_{k=2..n} 8^k.

  • A247842: a(n) = Sum_{k=2..n} 9^k.

  • A247849: Apollo missions that landed humans on the moon.

  • A247904: Start with a single pentagon; at n-th generation add a pentagon at each expandable vertex (this is the “vertex to side” version); a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)

  • A247968: a(n) = least k such that (k!*e^k)/(sqrt(2*Pi)*k^(k+1/2)) - 1 < 1/2^n.

  • A247973: Least k such that Pi - (4*k+2)/v(2*k+2)^2 < 1/n, where the sequence v is defined in Comments.

  • A247974: Numbers k such that A247973(k+1) = A247973(k).