Summary of block A128
Sequences in block A128
Section titled “Sequences in block A128”-
A128012: a(n) = 3*A001399(n).
-
A128013: a(n) = (n^3 +n)*5^n.
-
A128014: Central binomial coefficients C(2n,n) repeated.
-
A128015: Binomial coefficients C(2n+1,n) repeated.
-
A128016: Expansion of (1+x+x^2+x^3)/(1-x^2+x^4).
-
A128017: Expansion of (1+2x+x^2-x^3)/(1-x^2+x^4).
-
A128018: Expansion of (1-4*x)/(1-2*x+4*x^2).
-
A128019: Expansion of (1 - 3x)/(1 + 3*x^2).
-
A128021: a(n) = A128020(n)/n.
-
A128037: Maximal possible number of vectors in {0,1,2,3}^n such that the Hamming distance between every two is odd.
-
A128043: (n^3+n)*6^n.
-
A128048: (n^3+n)*8^n.
-
A128051: (n^3+n)*7^n.
-
A128054: List the nonnegative integers where multiples of 6 occur twice and numbers of the form 6k+4 are omitted.
-
A128055: a(n) = 2^A128054(n).
-
A128059: a(n) = numerator((2*n-1)^2/(2*(2*n)!)).
-
A128074: a(n) = (n^3+n)*9^n.
-
A128091: Row sums of unsigned A128090.
-
A128092: a(n) = largest multiple of n which is <= 2^n.
-
A128093: a(n) = smallest multiple of n which is >= 2^n.
-
A128127: The number of regular pentagons found by constructing n equally-spaced points on each side of the pentagon and drawing lines parallel to the pentagon side.
-
A128130: Expansion of (1-x)/(1+x^4); period 8: repeat [1,-1,0,0,-1,1,0,0].
-
A128135: Row sums of A128134.
-
A128153: The number of regular pentagons found by constructing n equally-spaced points on each side of the pentagon and drawing lines parallel to the pentagon sides, as well as lines connecting vertices.
-
A128162: a(n) = 3^n modulo Fibonacci(n).
-
A128174: Transform, (1,0,1,…) in every column.
-
A128183: Row sums of triangle A128182.
-
A128205: a(n) = 2^(n-1)*A047240(n).
-
A128209: Jacobsthal numbers(A001045) + 1.
-
A128213: Expansion of (1-x+2x^2-2x^3)/(1-x+x^2)^2.
-
A128214: Expansion of (1+2x+3x^2)/(1+x+x^2)^2.
-
A128223: a(n) = if n mod 2 = 0 then n*(n+1)/2 otherwise (n+1)^2/2-1.
-
A128309: a(n) = 2*A000069(n).
-
A128311: Remainder upon division of 2^(n-1)-1 by n.
-
A128406: a(n) = (n+1)*2^(n*(n+1)).
-
A128415: Expansion of (1-4x^2)/(1+3x+4x^2).
-
A128422: Projective plane crossing number of K_{4,n}.
-
A128439: a(n) = floor(n*t^n), where t=golden ratio=(1+sqrt(5))/2.
-
A128464: Numbers that are congruent to {11, 17, 29} mod 30.
-
A128467: a(n) = 30*n + 11.
-
A128468: a(n) = 30*n + 17.
-
A128469: Numbers of the form 30k+29 or possible lower bounds of twin primes pairs ending in 9.
-
A128470: a(n) = 30*n + 1.
-
A128471: a(n) = 30*n + 7.
-
A128473: Numbers of the form 30*k+23 or numbers that cannot be part of a twin prime pair.
-
A128533: a(n) = F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers.
-
A128534: a(n) = Fibonacci(n)*Lucas(n-1).
-
A128535: a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.
-
A128543: a(n) = floor(2^(n-2)*3*n).
-
A128587: Row sums of A128586.
-
A128588: Expansion of g.f. x*(1+x+x^2)/(1-x-x^2).
-
A128615: Expansion of x/(1 + x + x^2 - x^3 - x^4 - x^5).
-
A128620: Row sums of A128619.
-
A128624: Row sums of A128623.
-
A128625: Expansion of (1+3*x)/(1-5*x).
-
A128634: Number of parallel permutations of length n.
-
A128650: Number of polygons on n vertices with exactly three faces.
-
A128782: a(n) = n^2*4^n.
-
A128784: a(n) = n^2*5^n.
-
A128785: a(n) = n^2*6^n.
-
A128786: n^2*7^n.
-
A128787: n^2*8^n.
-
A128788: a(n) = n^2*9^n.
-
A128789: n^3*2^n.
-
A128790: n^3*4^n.
-
A128791: a(n) = n^3 * 5^n.
-
A128792: n^3*6^n.
-
A128793: n^3*7^n.
-
A128794: n^3*8^n.
-
A128795: n^3*9^n.
-
A128796: a(n) = n*(n-1)*2^n.
-
A128797: (n^2-n)*3^n.
-
A128798: n*(n-1)*4^n.
-
A128799: a(n) = n*(n-1)*5^n.
-
A128800: a(n) = n*(n-1)*6^n.
-
A128801: a(n) = n*(n-1)*7^n.
-
A128802: a(n) = n*(n-1)*8^n.
-
A128803: a(n) = n*(n-1)*9^n.
-
A128814: a(0)=1, a(n)= Product_{k=1..n} k*(k+1)/2+1.
-
A128822: Number of solutions to x/3 + y/4 + z/6 < n with x,y,z>=1 .
-
A128831: Number of n-tuples where each entry is chosen from the subsets of {1,2,3} such that the intersection of all n entries is empty.
-
A128832: Number of n-tuples where each entry is chosen from the subsets of {1,2,3,4} such that the intersection of all n entries is empty.
-
A128833: Number of n-tuples where each entry is chosen from the subsets of {1,2,3,4,5} such that the intersection of all n entries is empty.
-
A128834: Periodic sequence 0,1,1,0,-1,-1,…
-
A128862: Numbers simultaneously triangular and centered triangular.
-
A128865: Number of n-tuples where each entry is chosen from the subsets of {1,2,3,4} such that the intersection of all n entries contains exactly one element.
-
A128866: Number of n-tuples where each entry is chosen from the subsets of {1,2,3,4,5} such that the intersection of all n entries contains exactly one element.
-
A128874: Numbers k such that 16 + the product of the first k lesser twin primes (A097489) is prime.
-
A128880: Triangular numbers congruent to 1 or 5 mod 6.
-
A128882: a(n) = n!! - 1.
-
A128889: a(n) = (2^(n^2) - 1)/(2^n - 1).
-
A128929: Diameter of a special type of regular graph of degree 4 whose order maintain an increase in form of an arithmetic progression.
-
A128960: a(n) = (n^3 - n)*2^n.
-
A128961: a(n) = (n^3 - n)*3^n.
-
A128962: a(n) = (n^3 - n)*4^n.
-
A128963: a(n) = (n^3 - n)*5^n.
-
A128964: a(n) = (n^3-n)*6^n.
-
A128965: a(n) = (n^3 - n)*7^n.
-
A128967: a(n) = (n^3-n)*8^n.
-
A128969: a(n) = (n^3 - n)*9^n.
-
A128985: a(n) = (n^3 - n^2)*2^n.
-
A128986: a(n) = (n^3 - n^2)*3^n.
-
A128987: a(n) = (n^3 - n^2)*4^n.
-
A128988: a(n) = (n^3 - n^2)*5^n.
-
A128989: a(n) = (n^3 - n^2)*6^n.
-
A128990: a(n) = (n^3 - n^2)*7^n.
-
A128991: a(n) = (n^3 - n^2)*8^n.
-
A128992: a(n) = (n^3 - n^2)*9^n.
-
A128999: Start with an integer (in this case 1). First, add 5 or 6 if the integer is odd or even, respectively. Then divide by 2.