Summary of block A293
Sequences in block A293
Section titled “Sequences in block A293”-
A293004: Expansion of 2*x^2 / (x^3 + x^2 - 3x + 1).
-
A293005: Number of associative, quasitrivial, and order-preserving binary operations on the n-element set {1,…,n}.
-
A293006: Expansion of 2*x^2*(x+1) / (2*x^3-3*x+1).
-
A293007: Expansion of 2*x^2 / (1-2*x-2*x^2).
-
A293014: a(n) = a(n-1) + a(n-2) - a(n-3) + a(n-4) for n > 4, where a(n)=0 for n < 4 and a(4) = 1.
-
A293023: Generalized pentagonal numbers that are also Pell numbers.
-
A293046: Number of even permutations on {1,2,…,n} with exactly 2 weak excedances.
-
A293047: Number of odd permutations on {1,2,…,n} with exactly 2 weak excedances.
-
A293064: Number of vertices of type B at level n of the hyperbolic Pascal pyramid PP_(4,5).
-
A293066: Number of vertices at level n of the hyperbolic Pascal pyramid PP_(4,5).
-
A293067: Sum of values of vertices of type A at level n of the hyperbolic Pascal pyramid PP_(4,5).
-
A293077: Number of letters (0’s and 1’s) in the n-th iterate of the final-letter-removed mapping defined at A289035.
-
A293078: a(n) = (1/2)*A293077(n).
-
A293137: a(0) = 0, and a(n) = floor(2*sqrt(n)) - 1 for n >= 1.
-
A293162: Take every third term of the {0,1}-version of the Thue-Morse sequence: a(n) = A010060(3n).
-
A293163: a(n) = A010060(3n+1).
-
A293164: a(n) = A010060(3n+2).
-
A293270: a(n) = n^n*binomial(2*n-1, n).
-
A293292: Numbers with last digit less than 5 (in base 10).
-
A293296: a(n) = 2*n^2 - floor(n/4).
-
A293327: Greatest integer k such that k/2^n < sqrt(1/3).
-
A293337: Least integer k such that k/2^n > e.
-
A293339: Greatest integer k such that k/2^n < 1/e.
-
A293340: Least integer k such that k/2^n > 1/e.
-
A293411: a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4.
-
A293458: Numerator of probability that a permutation of elements of some subset of set {1,2,…,n} is a permutation of elements of some set of the form 1..k, k <= n.
-
A293475: a(n) = (3*n + 4)*Pochhammer(n, 4) / 4!.
-
A293476: a(n) = ((n + 1)/2)*(n + 2)*Pochhammer(n, 5) / 4!.
-
A293481: Numbers with last digit greater than or equal to 5 (in base 10).
-
A293505: a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/2|.
-
A293543: a(n) = ceiling(Fibonacci(n)/3).
-
A293544: a(n) = round(Fibonacci(n)/3).
-
A293545: a(n) is the greatest integer k such that k/Fibonacci(n) < 2/3.
-
A293546: a(n) is the least integer k such that k/Fibonacci(n) > 2/3.
-
A293547: a(n) is the integer k that minimizes |k/Fibonacci(n) - 2/3|.
-
A293552: a(n) is the least integer k such that k/Fibonacci(n) > 1/4.
-
A293553: a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/4|.
-
A293615: a(n) = Pochhammer(n, 5) / 2.
-
A293631: Greatest integer k such that k/Fibonacci(n) <= 3/4.
-
A293632: Least integer k such that k/Fibonacci(n) >= 3/4.
-
A293633: a(n) is the integer k that minimizes |k/Fibonacci(n) - 3/4|.
-
A293637: a(n) is the least integer k such that k/Fibonacci(n) > 1/5.
-
A293638: a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/5|.
-
A293639: a(n) is the greatest integer k such that k/Fibonacci(n) < 2/5.
-
A293640: a(n) is the least integer k such that k/Fibonacci(n) > 2/5.
-
A293641: a(n) is the integer k that minimizes |k/Fibonacci(n) - 2/5|.
-
A293642: a(n) is the greatest integer k such that k/Fibonacci(n) < 3/5.
-
A293644: a(n) is the integer k that minimizes |k/Fibonacci(n) - 3/5|.
-
A293653: Young urn sequence (number of possible evolutions in n steps of the “Young” Pólya urn).
-
A293656: a(n) = binomial(n+1,2)*n!/n!!.
-
A293671: a(n) is the greatest integer k such that k/Fibonacci(n) < 4/5.
-
A293672: a(n) is the least integer k such that k/Fibonacci(n) > 4/5.
-
A293673: a(n) is the integer k that minimizes |k/Fibonacci(n) - 4/5|.
-
A293688: Partial sums of A002251.
-
A293931: Number of circularly chained n-tuples of 2 X 2 alternating sign matrices.
-
A293956: Maximum over all sets of n points in the plane of the number of second-smallest distances between the points.
-
A293962: Number of linear chord diagrams having n chords and maximal chord length n, a(0)=1.
-
A293990: a(n) = (3*n + ((n-2) mod 4))/2.