Summary of block A086
Sequences in block A086
Section titled “Sequences in block A086”-
A086090: 2^n+n3^n.
-
A086093: a(n) = 3^n + 2*n*4^(n-1).
-
A086112: Denominator of the mean deviation of a discrete uniform distribution on n elements.
-
A086113: Number of 3 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing.
-
A086114: Number of 4 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing.
-
A086159: Number of partitions of n into the first three triangular numbers, 1, 3 and 6.
-
A086161: Number of monomial ideals in two variables x, y that are Artinian, integrally closed, of colength n and contain x^2.
-
A086166: (2^n - 1)^(2^n - 1).
-
A086205: Determinant of n X n matrix M_(i,j) = binomial(i^2, j).
-
A086206: Number of n X n matrices with entries in {0,1} with no zero row and with zero main diagonal.
-
A086208: Prime numbers p with the property that the sequence p-1*2, p-2*3, p-3*4, p-4*5, …, consists only of primes and a final 1.
-
A086219: Duplicate of A055010.
-
A086221: Bisection of A086652.
-
A086224: a(n) = 7*2^n - 1.
-
A086225: a(n) = 11*2^n - 1.
-
A086274: Antidiagonal sums of A086272 (and of A086273).
-
A086302: a(n) = 4*n^4 + 24*n^3 + 48*n^2 + 36*n + 8.
-
A086325: Let u(1)=0, u(2)=1, u(k)=u(k-1)+u(k-2)/(k-2); then a(n)=n!*u(n).
-
A086340: Numbers n such that 1 + (n-1)*n*(n+1) is a square.
-
A086343: a(n) starts new run of consecutive values in A055938.
-
A086344: a(n) = -2*a(n-1) + 4*a(n-2), a(0) = 1, a(1) = 0.
-
A086346: On a 3 X 3 board, the number of n-move paths for a chess king ending in a given corner square.
-
A086347: On a 3 X 3 board, number of n-move routes of chess king ending in a given side square.
-
A086348: On a 3 X 3 board, number of n-move routes of chess king ending in the central square.
-
A086351: T(n,3) of A086350.
-
A086358: Digital root of n!.
-
A086377: a(1)=1; a(n)=a(n-1)+2 if n is in the sequence; a(n)=a(n-1)+2 if n and (n-1) are not in the sequence; a(n)=a(n-1)+3 if n is not in the sequence but (n-1) is in the sequence.
-
A086388: Duplicate of A008619.
-
A086405: Row T(n,3) of number array A086404.
-
A086444: Sequence associated with palindromic structures.
-
A086445: Partial sums of A005578.
-
A086462: Expansion of (1+x)(1+4x)/((1-x)(1-4x)).
-
A086483: Bit that is two places to left of least significant 1-bit in the binary expansion of n.
-
A086500: Group the natural numbers such that the n-th group sum is divisible by the n-th triangular number: (1), (2, 3, 4), (5, 6, 7), (8, 9, 10, 11, 12), (13, 14, 15, 16, 17), (18, 19, 20, 21, 22, 23, 24), … Sequence contains the group sum.
-
A086514: Difference between the arithmetic mean of the neighbors of the terms and the term itself follows the pattern 0,1,2,3,4,5,…
-
A086515: Duplicate of A047241.
-
A086570: Expansion of (1 + 3x + 5x^2 + 7x^3 + …) / (1 - 2x + 3x^2 - 4x^3 + …).
-
A086573: a(n) = 2*(10^n - 1).
-
A086574: a(n) = 3*(10^n - 1).
-
A086575: a(n) = 4*(10^n - 1).
-
A086576: a(n) = 5*(10^n - 1).
-
A086577: a(n) = 6*(10^n - 1).
-
A086578: a(n) = 7*(10^n - 1).
-
A086579: a(n) = 8*(10^n - 1).
-
A086580: a(n) = 9*(10^n - 1).
-
A086594: a(n) = 8*a(n-1) + a(n-2), starting with a(0)=2 and a(1)=8.
-
A086601: Triangular numbers + 1 squared.
-
A086602: a(n) = A000217(A000217(n))-n^2.
-
A086603: a(n) = n^3*3^(n-1).
-
A086605: a(n) = 9*n^3 - 18*n^2 + 10*n.
-
A086640: Arrange n^2 octagons that each have area 7 so that they leave (n-1)^2 square gaps each with area 2; a(n) is the total area of these polygons.
-
A086653: a(n) = 2^n + 3*n.
-
A086676: Number of n-dimensional 2 X 2 X … X 2 grid graphs needed to cover an n-dimensional 3 X 3 X … X 3 torus.
-
A086689: a(n) = Sum_{i=1..n} i^2*t(i), where t = A000217.
-
A086694: A run of 2^n 1’s followed by a run of 2^n 0’s, for n=0, 1, 2, …
-
A086695: a(n) = 100^n - 10^n - 1.
-
A086707: Smallest mode of the sequences n/(n-k)*binomial(n,n-k) (see link).
-
A086714: a(1) = 4, a(n) = a(n-1)*(a(n-1) - 1)/2.
-
A086746: Multiples of 3018.
-
A086748: Odd numbers m such that when C(2k, k) == 1 (mod m) then k is necessarily even.
-
A086755: Sum_{k=1..n} (k(k+1))^2/2.
-
A086760: a(n) = 8n^2 + 88n + 43.
-
A086767: Last coefficient of the last term in the numerator of the simplified expansion of the solutions of FLT for n=2 for FLT n=1,2,3,..
-
A086790: a(n) = floor((1+n+2*n^2+4*n^3)/(1+2*n+n^2)).
-
A086812: Number of symmetric invertible n X n matrices over GF(2).
-
A086813: a(1)=1 then a(n)= (1/2) *(5*a(n-1)+1) if a(n-1) is odd, a(n)=3/2*a(n-1) otherwise.
-
A086814: a(n) = ceiling( (1 + n + 2*n^2 + 4*n^3)/(1 + 2*n + n^2) ).
-
A086815: a(n)=(n-1)*n^(2*n).
-
A086822: a(n) = floor((6*n^0+5*n^1+4*n^2+3*n^3) / (1*n^0+1*n^1+1*n^2)).
-
A086829: Number of n X n matrices on n^2 distinct symbols modulo rotations and reflections.
-
A086851: a(0) = 1, a(n+1) = a(n)^2 - n.
-
A086857: a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2) + 1)^2.
-
A086858: Let f(n) be the inverse of the function g(x) = x^x. Then a(n) = floor(f(n)).
-
A086893: a(n) is the index of F(n+1) at the unique occurrence of the ordered pair of reversed consecutive terms (F(n+1),F(n)) in Stern’s diatomic sequence A002487, where F(k) denotes the k-th term of the Fibonacci sequence A000045.
-
A086894: a(n) = (A000522(2*n) + 1)/2.
-
A086901: a(1) = a(2) = 1; for n>2, a(n) = 4*a(n-1) + 3*a(n-2).
-
A086902: a(n) = 7*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 7.
-
A086903: a(n) = 8*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 8.
-
A086926: Product of Fibonacci and (shifted) triangular numbers.
-
A086927: a(n) = 10*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 10.
-
A086928: a(n) = 12*a(n-1) + a(n-2), with a(0) = 2 and a(1) = 12.
-
A086940: a(n) = k where R(k+4) = 2.
-
A086941: a(n) = k where R(k+6) = 3.
-
A086942: Integers k such that R(k+8) = 4.
-
A086943: Integers k such that R(k+7) = 3.
-
A086944: a(n) = k where R(k+8) = 5.
-
A086945: a(n) = 7*10^n - 9.
-
A086946: Numbers k such that R(k+6) = 2.
-
A086947: Numbers k such that R(k+9) = 3.
-
A086948: a(n) = k where R(k+8) = 2.
-
A086949: Numbers k such that R(k+9) = 5.
-
A086950: Binomial transform of decagonal numbers A001107.
-
A086952: a(n) = n^2*4^n/4.
-
A086953: Binomial transform of (-1)^mod(n,3) (A257075).
-
A086955: a(n) = n^2 + 2*n + 2 - (-1)^n.
-
A086970: Fix 1, then exchange the subsequent odd numbers in pairs.
-
A086972: a(n) = n*3^(n-1) + (3^n + 1)/2.
-
A086984: Number of arrangements of n labeled balls in n labeled columns where only 1 column may have more than 1 ball.