Summary of block A093
Sequences in block A093
Section titled “Sequences in block A093”-
A093001: Least k such that Sum_{r=n+1..k} r is greater than or equal to the sum of the first n positive integers (i.e., the n-th triangular number, A000217(n)). Or, least k such that (sum of first n positive integers) <= (sum of numbers from n+1 up to k).
-
A093002: Product of factorials of next n numbers.
-
A093005: a(n) = n * ceiling(n/2).
-
A093033: Number of interior balls in a truncated octahedral arrangement.
-
A093040: Expansion of (1+x)/((1+x+x^2)(1-x-x^2)).
-
A093042: Jacobsthal(n)*Fibonacci(n).
-
A093043: Jacobsthal(n)*Fibonacci(n-1).
-
A093044: A Jacobsthal Fibonacci product: a(n) = (2^n + 2*(-1)^n)*Fibonacci(n-1)/3.
-
A093045: 2*Jacobsthal(n-1)*Fibonacci(n).
-
A093060: a(n) = smallest m such that numerator of Bernoulli(2m) is divisible by the first n irregular primes.
-
A093069: a(n) = (2^n + 1)^2 - 2.
-
A093112: a(n) = (2^n-1)^2 - 2.
-
A093121: A Jacobsthal Fibonacci product.
-
A093122: a(n) = Jacobsthal(n) * Fibonacci(n+1).
-
A093123: Third binomial transform of Fibonacci(3n-1) (A015448).
-
A093129: Binomial transform of Fibonacci(2n-1) (A001519).
-
A093130: Third binomial transform of Fibonacci(3n).
-
A093131: Binomial transform of Fibonacci(2n).
-
A093132: Third binomial transform of Fibonacci(3n+2).
-
A093134: A Jacobsthal trisection.
-
A093135: Expansion of g.f. (1-8*x)/((1-x)*(1-10*x)).
-
A093136: Expansion of (1 - 8*x)/(1 - 10*x).
-
A093137: Expansion of (1-7*x)/((1-x)*(1-10*x)).
-
A093138: Expansion of (1-7x)/(1-10x).
-
A093140: Expansion of (1-6*x)/((1-x)*(1-10*x)).
-
A093141: Expansion of (1-6*x)/(1-10*x).
-
A093142: Expansion of g.f. (1-5*x)/((1-x)*(1-10*x)).
-
A093143: Expansion of (1-5*x)/(1-10*x).
-
A093145: Third binomial transform of Fibonacci(3n)/Fibonacci(3).
-
A093148: a(n) = gcd(Fibonacci(n+5), Fibonacci(n+1)).
-
A093149: a(1) = 4; a(n) = (n^(n+1)+2*n-3)/(n-1) for n > 1.
-
A093178: If n is even then 1, otherwise n.
-
A093197: Number of labeled plane 2-trees on n triangles.
-
A093230: a(n) is the largest number such that all of a(n)‘s length-n substrings are distinct and divisible by 30.
-
A093302: a(n) = (a(n-1)+(2n-1))*(2n) with a(0) = 0.
-
A093303: a(n) = a(n-1)*(2n-1) + 2n with a(0)=0.
-
A093328: a(n) = 2*n^2 + 3.
-
A093329: Isogonal polyhedra with convex faces exist just for these genera.
-
A093344: a(n) = n! * Sum_{i=1..n} (1/i)*Sum_{j=0..i-1} 1/j!.
-
A093345: a(n) = n! * {1 + Sum[i=1..n, 1/i*Sum(j=0..i-1, 1/j!)]}.
-
A093356: Number of occurrences of pattern 1-2 after n iterations of morphism A007413.
-
A093357: Number of occurrences of pattern 2-1 after n iterations of morphism A007413.
-
A093379: Expansion of x(1-2x-2x^2)/((1+x)(1-2x)(1-3x)).
-
A093382: a(n) = length k of longest binary sequence x(1) … x(k) such that for no n <= i < j <= k/2 is x(i) … x(2i) a subsequence of x(j) … x(2j).
-
A093384: Another of the 16 sequences illustrating the fact that A093382(2) = 31.
-
A093410: Erroneous version of A090498.
-
A093434: a(n) = Product_{i=1..n} (2*n-i)*(2*n+i).
-
A093435: Duplicate of A048964.
-
A093450: Number of consecutive integers whose product = A093449(n).
-
A093460: a(n) = 2n^(n-1) - 1.
-
A093461: a(1)=1, a(n) = 2*(n^(n-1)-1)/(n-1) for n >= 2.
-
A093465: Minimal number of vertices in polyhedron of genus n.
-
A093467: a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).
-
A093468: a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum {a(n)-a(i), i = 1 to n}.
-
A093485: a(n) = (27*n^2 + 9*n + 2)/2.
-
A093500: a(n) = (15*n^2 + 5*n + 2)/2.
-
A093504: A093503(k) is a term if A093503(k) and A093503(k+1) are successive primes.
-
A093505: a(n) = floor(A001969(n)/2 + 1/2).
-
A093509: Multiples of 5 or 6.
-
A093522: Numbers k such that k^k - (k-1)^2 is prime.
-
A093544: Numerator of (4*n-3)/A000265(n). Numerator of pairwise quotients of A004130.
-
A093609: Upper Beatty sequence for e^G, G = Euler’s gamma constant.
-
A093610: Lower Beatty sequence for e^G, G = Euler’s gamma constant.
-
A093718: a(n) = (n mod 3)^(n mod 2).
-
A093719: a(n) = (n mod 2)^(n mod 3).
-
A093801: a(n) = b(n)*Integral_{x=0..1/(4^n)} (1 - sqrt(x)) dx, where b(n) = 3*24^n.
-
A093833: 3^n-Jacobsthal(n).
-
A093834: Expansion of (1-2x)^2/((1-3x)(1-4x)).
-
A093835: n*Jacobsthal(n).
-
A093883: Product of all possible sums of two distinct numbers taken from among first n natural numbers.
-
A093904: Duplicate of A093344.
-
A093907: Number of elements in the n-th period of the periodic table as predicted by the Aufbau principle.
-
A093916: a(2*k-1) = (2*k-1)^2 + 2 - k, a(2*k) = 6*k^2 + 2 - k: First column of the triangle A093915.
-
A093918: a(2*k-1) = (2*k-1)^2+k, a(2*k) = 6*k^2+k+1: Last term in rows of triangle A093915.
-
A093953: a(n) = rightmost term in M^n * [1,1,1], where M = a 3 X 3 matrix composed of the first 3 rows of A050166 (fill in the matrix with zeros): = [1 0 0 / 1 2 0 / 1 4 5].
-
A093959: Squares arising as partial products in A094357 + 1.
-
A093964: a(n) = Sum_{k=1..n} k*k!*C(n,k).
-
A093965: Number of functions of [n] to [n] that simultaneously avoid the patterns 112 and 221.
-
A093967: a(n) = n * Pell(n).
-
A093968: Inverse binomial transform of n*Pell(n).
-
A093969: a(n) = n*Pell(n-2).
-
A093986: a(1) = 1, a(2) = 1, a(n+1) = 2n*a(n) - a(n-1). Symmetrically a(n) = (a(n-1) + a(n+1))/((n-1) + (n+1)).