Summary of block A116
Sequences in block A116
Section titled “Sequences in block A116”-
A116048: sigma(n) times the n-th prime gives a triangular number.
-
A116138: a(n) = 3^n * n*(n + 1).
-
A116144: a(n) = 4^n * n*(n+1).
-
A116150: a(n) = Sum_{j=1..n} (3^j + (-2)^j).
-
A116156: a(n) = 5^n * n*(n + 1).
-
A116164: a(n) = 6^n * n*(n+1).
-
A116165: a(n) = 7^n * n*(n+1).
-
A116166: a(n) = 8^n * n*(n+1).
-
A116176: a(n) = 9^n * n*(n+1).
-
A116404: Expansion of (1-x)/((1-x)^2 - x^2*(1+x)^2).
-
A116415: a(n) = 5*a(n-1) - 3*a(n-2).
-
A116446: Let Sq(n) denote the square grid consisting of all lattice points (x,y) such that x,y are in {0,1,…,n}. a(n) is the minimum number t such that there are t of the (n+1)^2 lattice points in Sq(n) so that the binomial(t,2) lines that they determine cover all points in Sq(n).
-
A116447: a(2n) = n, a(2n+1) = n!.
-
A116453: Third smallest number with exactly n prime factors.
-
A116454: Smallest m such that A116452(m) = n.
-
A116468: Permutation of natural numbers generated by 2-rowed array shown below.
-
A116471: Values 2*(n -+ 1)^2 sorted.
-
A116483: Expansion of (1 + x) / (5*x^2 - 2*x + 1).
-
A116530: a(n) = 3*a(n-1), with a(1) = 20.
-
A116556: a(n) = 2*a(n-1) + 2*a(n-2), a(0)=0, a(1)=4.
-
A116562: Duplicate of A045925.
-
A116582: Numbers from Bhargava’s 33 theorem.
-
A116609: a(n) = 13^n mod n.
-
A116668: a(n) = (5*n^2 + n + 2)/2.
-
A116689: Partial sums of dodecahedral numbers (A006566).
-
A116697: a(n) = -a(n-1) - a(n-3) + a(n-4).
-
A116699: Number of permutations of length n which avoid the patterns 123 and 4312.
-
A116701: Number of permutations of length n that avoid the patterns 132, 4321.
-
A116702: Number of permutations of length n which avoid the patterns 123, 3241.
-
A116711: Number of permutations of length n which avoid the patterns 123, 3214, 4312.
-
A116712: Number of permutations of length n which avoid the patterns 231, 3214, 4312.
-
A116713: Number of permutations of length n which avoid the patterns 123, 2431, 4132.
-
A116717: Number of permutations of length n which avoid the patterns 231, 1423, 3214.
-
A116721: Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.
-
A116725: Number of permutations of length n which avoid the patterns 132, 3421, 4231.
-
A116728: Number of permutations of length n which avoid the patterns 321, 1243, 2134.
-
A116729: Duplicate of A048840.
-
A116730: Number of permutations of length n which avoid the patterns 321, 1342, 1423.
-
A116731: Number of permutations of length n which avoid the patterns 321, 2143, 3124; or avoid the patterns 132, 2314, 4312, etc.
-
A116735: Number of permutations of length n which avoid the patterns 231, 1234, 4312; or avoid the patterns 312, 1234, 1432, etc.
-
A116757: Number of permutations of length n which avoid the patterns 1324, 2314, 4312.
-
A116899: Numbers k such that (k concatenated k times) + 1 = A000461(k) + 1 is a prime number.
-
A116921: a(n) = largest integer <= n/2 which is coprime to n.
-
A116922: a(n) = smallest integer >= n/2 which is coprime to n.
-
A116939: Lexicographically earliest sequence such that each i occurs exactly i+1 times and succeeding terms differ exactly by -1 or +1.
-
A116940: Greatest m such that A116939(m) = n.
-
A116944: a(1) = 1; for n>1, a(n)=(a(n-1)+1)^n.
-
A116948: Riordan array ((1+2x^2)/(1-x^3),x).
-
A116952: a(n) = 3*a(n-1) + 5 with a(0) = 1.
-
A116966: a(n) = n + {1,2,0,1} according as n == {0,1,2,3} mod 4.
-
A116969: If n mod 2 = 0 then 3*2^(n-1)+n-1 else 3*2^(n-1)+n.
-
A116970: a(n) = (3^n - 7)/2.
-
A116971: a(n) = (35*2^((2*(3*n+2) + 2)/3) - 2*(3*n+2) - 46)/9.
-
A116972: a(n) = 11*3^n - 2*n - 10.
-
A116973: If n mod 2 = 0 then (3^(n+3)-19)/8 else (3^(n+3)-1)/8.
-
A116996: Partial sums of A116966.