Skip to content

Summary of block A110

107 sequences
  • A110000: Minimal number of polygonal pieces in a dissection of a regular n-gon to an equilateral triangle (conjectured).

  • A110034: Row sums of a characteristic triangle for the Fibonacci numbers.

  • A110035: Row sums of an unsigned characteristic triangle for the Fibonacci numbers.

  • A110043: a(0) = 1, a(1) = 2; for n>1, a(n) = n*a(n-1) + (-1)^n.

  • A110046: Expansion of (1+4*x-12*x^2-16*x^3)/((2*x+1)*(2*x-1)*(4*x^2+4*x-1)).

  • A110047: Expansion of (1+2*x-4*x^2)/((2*x+1)*(2*x-1)*(4*x^2+4*x-1)).

  • A110048: Expansion of 1/((1+2*x)*(1-4*x-4*x^2)).

  • A110067: Numbers n such that 10^n + sigma(n) is prime.

  • A110090: Numerators of sequence of rationals defined by r(n) = n for n<=1 and for n>1: r(n) = (sum of denominators of r(n-1) and r(n-2))/(sum of numerators of r(n-1) and r(n-2)).

  • A110131: Determinant of n X n matrix M_{i,j} = 2^i*P_i(j), where P_i(j) is the Legendre polynomial of order i at j and i and j are 0-based.

  • A110139: a(n) = floor(n/2)^floor(n/2).

  • A110146: a(n) = n^(n+1) mod (n+2).

  • A110147: 10^((n^2-n)/2).

  • A110161: Expansion of x*(1-x^2)/(1-x^2+x^4).

  • A110164: Expansion of (1-x^2)/(1+2x).

  • A110195: a(n) = 11^((n^2-n)/2).

  • A110199: a(n) = Sum_{k=0..floor(n/2)} Catalan(k).

  • A110206: Row sums of triangle A110205, where A110205(n,k) equals the sum of cubes of numbers < 2^n having exactly k ones in their binary expansion.

  • A110214: Minimal number of knights to cover a cubic board.

  • A110215: Inequivalent coverings of a cubic board with the minimal number of knights.

  • A110269: n mod 2 + n mod 3.

  • A110270: a(n) = (n mod 2)*(n mod 3).

  • A110272: a(n) = Pell(n)^3.

  • A110286: a(n) = 15*2^n.

  • A110287: a(n) = 17*2^n.

  • A110288: a(n) = 19*2^n.

  • A110294: a(2*n) = A028230(n), a(2*n+1) = -A067900(n+1).

  • A110322: Row sums of A110321, a number triangle related to the Jacobsthal numbers.

  • A110325: Row sums of number triangle related to the Jacobsthal numbers.

  • A110331: Row sums of a number triangle related to the Pell numbers.

  • A110344: a(n) = Sum_{k=0..n-1} (n+k) = n(3n-1)/2 if n is even; a(n) = Sum_{k=0..n-1} (n-k) = n(n+1)/2 if n is odd.

  • A110345: a(n) = n + (n+1) + (n+2) + … n terms if n is odd, else a(n) = n + (n-1) + (n-2) + … n terms = n(n+1)/2 = n-th triangular number if n is even.

  • A110349: a(n) = n + (n+1) + (n-1) + (n+2) + (n-2) … n terms.

  • A110360: Integers with mutual residues of 8.

  • A110365: a(1)=2, a(n+1) = a(n)*A010888(a(n)).

  • A110368: Integers with mutual residues of 9.

  • A110369: (Digit 1 repeated n times) + n.

  • A110371: a(n)=[(n+1)(n+2)(n+3)…(2n)]/(1+2+3+…+n).

  • A110383: Integers with mutual residues of 10.

  • A110384: a(1) = 1; a(n+1) = a(n)*(a(n) + n).

  • A110385: a(1) = 3; a(n+1) = (a(n) + n)*(a(n) - n).

  • A110386: a(1) = 1, a(2) = a(1) + 1, a(3) = a(2)^2 + a(2) + 1; a(n + 1) = a(n)^n + a(n)^(n-1) + … + a(n)^2 + a(n) + 1 = {a(n)^(n + 1)-1}/{a(n) - 1}.

  • A110387: a(1) = 1, a(2) = a(1) + 1, a(3) = a(2)^2 + a(1) + 1; a(n+1) = a(n)^n + a(n-1)^(n-1) + … + a(2)^2 + a(1) + 1.

  • A110389: Integers with mutual residues -1.

  • A110391: a(n) = L(3*n)/L(n), where L(n) = Lucas number.

  • A110426: The r-th term of the n-th row of the following array contains the sum of r successively decreasing integers beginning from n, 0 < r <= n (see Example).

  • A110427: The r-th term of the n-th row of the following array contains the sum of r successively decreasing integers beginning from n. 0 < r <= n. Sequence contains the leading diagonal.

  • A110430: Arithmetic mean of all n-digit positive even numbers.

  • A110431: Average of positive multiples of 3 with n decimal digits, rounded down.

  • A110450: a(n) = n*(n+1)*(n^2+n+1)/2.

  • A110451: a(n) = n*(4*n^2 + 2*n + 1).

  • A110452: Product of all k-digit numbers starting from n where k is the number of digits in n. a(n) = n*(n+1)*…*(10^k-1), where k is the number of digits in n.

  • A110468: a(n) = (2*n + 1)!/(n + 1).

  • A110491: Expansion of e.g.f.: sqrt(1+2x)/sqrt(1-2x).

  • A110507: Number of nodes in the smallest cubic graph with crossing number n.

  • A110512: Expansion of (1 + x)/(1 + x + 2x^2).

  • A110514: Expansion of (1 - x + x^2 + x^3)/(1 - x^2 - x^4 + x^6).

  • A110523: Expansion of (1 + x)/(1 + x + 3*x^2).

  • A110526: a(n+3) = 3*a(n+2) + 5*a(n+1) + a(n), a(0) = 0, a(1) = 1, a(2) = 3.

  • A110528: a(n+3) = 3*a(n+2) + 5*a(n+1) + a(n), a(0) = 1, a(1) = 10, a(2) = 37.

  • A110532: a(n) = floor(n/2) + floor(n/5).

  • A110533: a(n) = floor(n/2) * floor(n/5).

  • A110549: Period 8: repeat [1, 2, 4, 3, 3, 4, 2, 1].

  • A110551: Period 6: repeat [1, 3, 5, 5, 3, 1].

  • A110556: a(n) = binomial(2*n-1, n)*(-1)^n.

  • A110567: a(n) = n^(n+1) + 1.

  • A110568: Period 6: repeat [1, 0, 2, 2, 0, 1].

  • A110569: Period 6: repeat [2, 1, 3, 3, 1, 2].

  • A110591: Number of digits in base-4 representation of n.

  • A110592: Number of digits in base-5 representation of n. String length of A007091.

  • A110593: a(1) = 3, a(n+1) = 2*(3^n).

  • A110594: a(1) = 4, a(2) = 12, for n>1: a(n) = 3*4^(n-1).

  • A110595: a(1)=5. For n > 1, a(n) = 4*5^(n-1) = A005054(n).

  • A110609: a(n) = n * binomial(2*n, n-1).

  • A110610: Maximal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,…,n}.

  • A110611: Minimal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,…,n}.

  • A110614: a(n+3) = 5*a(n+2) - 2*a(n+1) - 8*a(n), a(0) = 1, a(1) = 5, a(2) = 15.

  • A110654: a(n) = ceiling(n/2), or: a(2*k) = k, a(2*k+1) = k+1.

  • A110655: a(n) = A110654(A110654(n)).

  • A110656: a(n) = A110654(A110654(A110654(n))).

  • A110657: a(n) = A028242(A028242(n)).

  • A110658: a(n) = A028242(A028242(A028242(n))).

  • A110659: a(n) = A028242(A110654(n)).

  • A110660: Oblong (promic) numbers repeated.

  • A110665: Sequence is {a(0,n)}, where a(m,0)=0, a(m,n) = a(m-1,n)+a(m,n-1) and a(0,n) is such that a(n,n) = n for all n.

  • A110666: Sequence is {a(1,n)}, where a(m,n) is defined at sequence A110665.

  • A110678: a(n) = -n^2 - n + 72.

  • A110679: a(n+3) = 3*a(n+2) + 5*a(n+1) + a(n), a(0) = 1, a(1) = 2, a(2) = 11.

  • A110807: n times largest n-digit number.

  • A110823: Weight enumerator of [32,6,16] Reed-Muller code RM(1,5).

  • A110825: Weight enumerator of [64,7,32] Reed-Muller code RM(1,6).

  • A110827: Weight enumerator of [128,8,64] Reed-Muller code RM(1,7).

  • A110829: Weight enumerator of [8,7,2] Reed-Muller code RM(2,3).

  • A110831: a(n) = 3*n^2 + 27*n + 1.

  • A110853: Squares of the form prime(k)*(k+1)^2 + 1.

  • A110862: Highest minimal distance of odd formally self-dual binary codes of length 2n.

  • A110864: Number of ternary self-dual codes of length 4n.

  • A110867: Highest minimal distance of Type I but not Type II additive Hermitian self-dual codes of length n over GF(4).

  • A110870: Highest minimal distance of Type II additive Hermitian self-dual codes of length n over GF(4).

  • A110881: Starting a priori with the fraction 1/1, list n when the numerator and denominator are both prime for fractions built according to the rule: Add old top and old bottom to get the new bottom, add old top and twice the old bottom to get the new top.

  • A110882: a(n) is the least integer x such that x^n < 2 * (x-1)^n.

  • A110887: Number of configurations of n skew lines up to isotopy.

  • A110899: Number of different stationary distributions of a certain random walk whose states are permutations of 1,…,n. The transitions depend on two sorted vectors x and z. The state sigma goes to rank((z[sigma]-x)[rperm] +x), where rperm is a random (uniform) permutation. If x and z are realizations of independent random variables X and Z and pi is a permutation drawn from the stationary distribution, the vector z[pi]-x is a realization of a random variable Y where Z ~ X+Y.

  • A110908: Start with the fraction 1/1, list n when the numerator and denominator are both prime for fractions built according to the rule: Add old top and old bottom to get the new bottom, add old top and 6 times the old bottom to get the new top.

  • A110953: Starting a priori with the fraction 1/1, the denominators of fractions built according to the rule: add top and bottom to get the new bottom, add top and 9 times the bottom to get the new top.

  • A110962: Fractalization of A025480, zero-based version of Kimberling’s paraphrases sequence.

  • A110963: Fractalization of Kimberling’s paraphrase of the binary number system beginning with 1.