Summary of block A159
Sequences in block A159
Section titled “Sequences in block A159”-
A159038: a(n) = 8 * n!.
-
A159058: A102370(n) modulo 8 .
-
A159075: a(1) = -1, otherwise a(n) = 0.
-
A159217: 1/8 the number of n X n arrays of squares of integers with every 2X2 subblock summing to 17.
-
A159221: 1/2 the number of n X n arrays of squares of integers with every 2X2 subblock summing to 20.
-
A159230: 1/8 the number of n X n arrays of squares of integers with every 2X2 subblock summing to 31.
-
A159254: Numbers whose square ends with 49.
-
A159289: a(n+1) = 5*a(n) - 2*a(n-1).
-
A159290: A generalized Jacobsthal sequence.
-
A159469: Maximum remainder when (k + 1)^n + (k - 1)^n is divided by k^2 for variable n and k > 2.
-
A159481: Number of evil numbers <= n, see A001969.
-
A159551: a(n) = 101*n + 10.
-
A159582: Expansion of (1+6*x+x^2-2*x^3)/((x^2+2*x-1)*(x^2-2*x-1)), bisection is NSW numbers.
-
A159605: E.g.f: Sum_{n>=1} a(n)*x^(2n-1)/(2n-1)! = Series_Reversion of e.g.f. S(x) of A159601.
-
A159612: INVERT transform of (1, 3, 1, 3, 1, …).
-
A159661: The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11*n(j) + 1 = a(j)*a(j) and 13*n(j) + 1 = b(j)*b(j) with positive integer elements. the solutions of the 2 equations problem: 11*n(j) + 1 = a(j)*a(j); 13*n(j) + 1 = b(j)*b(j); with integer numbers.
-
A159664: The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11*n(j) + 1 = a(j)*a(j) and 13*n(j) + 1 = b(j)*b(j), with positive integer numbers.
-
A159668: Expansion of (1 - x)/(1 - 28*x + x^2).
-
A159669: Expansion of x*(1 + x)/(1 - 28*x + x^2).
-
A159674: Expansion of (1 - x)/(1 - 32*x + x^2).
-
A159675: Expansion of x*(1 + x)/(1 - 32*x + x^2).
-
A159678: The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2-equation problem 7*n(j) + 1 = a(j)*a(j) and 9*n(j) + 1 = b(j)*b(j) with positive integer numbers.
-
A159684: Sturmian word: limit S(infinity) where S(0) = 0, S(1) = 0,1 and for n>=1, S(n+1) = S(n)S(n)S(n-1).
-
A159694: a(n) = 2*a(n-1) + 2^(n-1), for n > 0, with a(0)=6.
-
A159695: a(0)=7, a(n) = 2*a(n-1) + 2^(n-1) for n > 0.
-
A159696: a(0)=8, a(n) = 2*a(n-1) + 2^(n-1) for n > 0.
-
A159697: a(0)=9, a(n) = 2*a(n-1) + 2^(n-1) for n > 0.
-
A159715: Number of permutations of 2 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
-
A159721: Number of permutations of 3 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
-
A159727: Number of permutations of 4 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
-
A159733: Number of permutations of 5 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
-
A159736: Number of permutations of 6 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
-
A159738: Number of permutations of 7 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
-
A159739: Number of permutations of 8 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
-
A159740: Number of permutations of 9 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
-
A159741: a(n) = 8*(2^n - 1).
-
A159742: If an array is made of columns of -nacci sequences (Fibonacci, tribonacci, etc.), all starting with 1,1,2,…, the NW-to-SE diagonals can be extended by computation. This sequence is diagonal 6. See A159741 for details.
-
A159783: Hankel transform of ordered Bell numbers A000670. a(n)=det(A000670(i+j-1)), i,j=1,2..n.
-
A159833: a(n) = n^2*(n^2 + 15)/4.
-
A159852: n^2 mod 60.
-
A159915: a(n) = floor((n+1)/4)*floor(n/2).
-
A159920: Sums of the antidiagonals of Sundaram’s sieve (A159919).
-
A159938: The number of homogeneous trisubstituted linear alkanes.
-
A159940: The number of trisubstitution products with composition C_n H_(2n-1) X_2 Y.
-
A159941: Number of trisubstituted linear alkanes of composition C_n H_(2n-1) XYZ.
-
A159955: Period 9: repeat [0, 1, 2, 1, 2, 0, 2, 0, 1].
-
A159956: Period 16 : 0,1,2,3,1,2,3,0,2,3,0,1,3,0,1,2 .
-
A159957: Period 25 : 0,1,2,3,4,1,2,3,4,0,2,3,4,0,1,3,4,0,1,2,4,0,1,2,3 .
-
A159964: a(n) = 2^n*(1-n).
-
A159966: Lodumo_4 of A102370 (sloping binary numbers).
-
A159991: Powers of 60: a(n) = 60^n.