Skip to content

Summary of block A089

69 sequences
  • A089011: a(n) = 1 if n is an exponent of the Weyl group W(E_7), 0 otherwise.

  • A089013: a(n) = (A088567(8n) mod 2).

  • A089026: a(n) = n if n is a prime, otherwise a(n) = 1.

  • A089043: a(n) = n!^2 + (-1)^n.

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

  • A089068: a(n) = a(n-1)+a(n-2)+a(n-3)+2 with a(0)=0, a(1)=0 and a(2)=1.

  • A089071: Number of liberties a big eye of size n gives in the game of Go.

  • A089081: 26th powers: a(n) = n^26.

  • A089104: Duplicate of A007334.

  • A089108: Convoluted convolved Fibonacci numbers G_4^(r).

  • A089128: a(n) = gcd(6,n).

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

  • A089145: Greatest common divisor of n^2-3 and n^2+3.

  • A089146: Greatest common divisor of n^2 - 4 and n^2 + 4.

  • A089154: Expansion of 2*x*(x+2) / ((x-1)*(x^2+6*x-1)).

  • A089155: a(n) = (2*n)!*(Integral_{x=0..sqrt(2/3)} 1/(1-x^2)^(n+1/2) dx)/((n!*2^n)*sqrt(2)).

  • A089181: (1,3) entry of powers of the orthogonal design shown in A090592.

  • A089205: a(n) = n^n * (n-1).

  • A089207: a(n) = 4n^3 + 2n^2.

  • A089208: Duplicate of A083282.

  • A089211: 10*n^n+(n-1).

  • A089214: Let u(1)=0, u(2)=1; for k>2, u(k)= A010060(k)*u(k-1) + u(k-2) (mod 2); then a(n)=4n-b(n) where sequence (b(k)) gives values such that u(b(k))=0.

  • A089252: a(n) = ((2*n-1)!!/sqrt(3))*(integral_{x=0..sqrt(3/4)} 1/(1-x^2)^(n+1/2) dx).

  • A089271: Third column (k=4) of array A078739(n,k) ((2,2)-generalized Stirling2).

  • A089301: Number of C-types (or contiguity types) of n-dimensional lattices.

  • A089303: a(n) = floor( (10^n - 1) / (9*n) ).

  • A089357: a(n) = 2^(6*n).

  • A089418: Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.

  • A089422: Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336 (and also of A082349/A082350, to be proved).

  • A089475: Number of different values taken by the permanent of a real nonsingular (0,1)-matrix of order n.

  • A089476: Number of different values taken by the permanent of a real singular (0,1)-matrix of order n.

  • A089485: Numbers k such that k^4 + 4^k = A001589(k) is a semiprime.

  • A089498: Duplicate of A046729.

  • A089499: a(0)=0; a(1)=1; a(2n) = 4*Sum_{k=0..n} a(2k-1); a(2n+1) = a(2n) + a(2n-1).

  • A089501: Built from superfactorials A000178.

  • A089507: Second column of triangle A089504 and second column of array A078741 divided by 18.

  • A089508: Solution to a binomial problem together with companion sequence A081016(n-1).

  • A089594: Alternating sum of squares to n.

  • A089598: G.f.: (1+x^2+x^3)/(1-x^3)^2.

  • A089607: a(n)=((-1)^(n+1)*A002425(n)) modulo 4.

  • A089626: a(n) = 1/h(n) where {h(n)} is the Hankel transform of {t(n)}; t(n) is defined by the expansion of tan(x)= Sum_n>0, t(n)*x^(2*n-1); |x|<Pi/2.

  • A089643: 3^a(n) divides C(3n,n); 3-adic valuation of A005809.

  • A089644: Numbers k such that 7 divides the numerator of B(2*k) where B(k) = the k-th Bernoulli number.

  • A089658: a(n) = S1(n,1), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).

  • A089678: Numbers n such that n^n + n! + n^2 + 1 is prime.

  • A089683: a(n) = 3^(4*n).

  • A089709: a(1) = 1, a(2) = 2; for n>2, a(n) = sum_{r=1..n} {sum of all previous terms taken r at a time}.

  • A089772: a(n) = Lucas(11*n).

  • A089775: Lucas numbers L(12n).

  • A089781: Successive coprime numbers with distinct successive differences: gcd(a(k+1),a(k)) = gcd(a(m+1),a(m)) = 1 and a(k+1)-a(k) = a(m+1)-a(m) <==> m=k.

  • A089792: a(n) = n-(exponent of highest power of 3 dividing n!).

  • A089794: Number of amphichiral alternating knots with n=2k crossings (k=2,3,4,…).

  • A089799: Expansion of Jacobi theta function theta_2(q^(1/2))/q^(1/8).

  • A089817: a(n) = 5*a(n-1) - a(n-2) + 1 with a(0)=1, a(1)=6.

  • A089833: a(n) = A000108(n)*(A000142(n+1)-1).

  • A089835: a(n) = (A000108(n)^2)*(n+1)!.

  • A089891: Number of knots and links with unknotting (unlinking) number U=1.

  • A089910: Indices n at which blocks (1;1) occur in infinite Fibonacci word, i.e., such that A005614(n-1) = A005614(n-2) = 1.

  • A089911: a(n) = Fibonacci(n) mod 12.

  • A089920: Indices of primes p such that 7^p - 2 is prime.

  • A089923: Duplicate of A100003.

  • A089926: a(n) = 12*a(n-1) + a(n-2), a(0)=1, a(1)=6.

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

  • A089931: a(n) = 3*a(n-1) + 3*a(n-3) + a(n-4).

  • A089945: Main diagonal of array A089944, in which the n-th row is the n-th binomial transform of the natural numbers.

  • A089946: Secondary diagonal of array A089944, in which the n-th row is the n-th binomial transform of the natural numbers.

  • A089950: Partial sums of A001652.

  • A089972: Duplicate of A008062.

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