Summary of block A112
Sequences in block A112
Section titled “Sequences in block A112”-
A112030: a(n) = (2 + (-1)^n) * (-1)^floor(n/2).
-
A112032: Denominator of 3/4 + 1/4 - 3/8 - 1/8 + 3/16 + 1/16 - 3/32 - 1/32 + 3/64 …
-
A112033: a(n) = 3 * 2^(floor(n/2) + 1 + (-1)^n).
-
A112062: Positive integers i for which A112049(i) == 2.
-
A112072: Odd numbers n for which 3 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.
-
A112087: a(n) = 4*(n^2 - n + 1).
-
A112088: Number of leaf nodes in a binary tree.
-
A112089: Erroneous version of A038119.
-
A112090: Degrees of nonconstant complex polynomials f(x) and g(x) such that (1) neither f nor g can be written nontrivially as r(s(x)), (2) f(x) does not equal g(ax+b) for complex numbers a,b and (3) f(x)-g(y) is reducible as a complex polynomial in two variables.
-
A112091: Number of idempotent order-preserving partial transformations (of an n-element chain).
-
A112132: Period 4: repeat [1, 3, 1, 7].
-
A112293: Row sums of number triangle A112292.
-
A112300: Expansion of x * (1 - x)^2 * (1 - x^2) / (1 - x^6) in powers of x.
-
A112332: a(n) = Product_{k=0..n-1} k!*binomial(2k,k).
-
A112335: Row sums of number triangle A112334.
-
A112346: Duplicate of A062318.
-
A112347: Kronecker symbol (-1, n) except a(0) = 0.
-
A112355: Triangular numbers that are the sum of three positive triangular numbers.
-
A112368: a(n) = Sum_{i=0..n} 2^i*i!.
-
A112369: a(n) = -1 + Sum_{i=0..n} 2^i*i!.
-
A112370: a(n) = Sum_{i=0..n} 3^i*i!.
-
A112373: a(n+2) = (a(n+1)^3 + a(n+1)^2)/a(n) with a(0)=1, a(1)=1.
-
A112414: a(n) = 3*n + 7.
-
A112415: a(n) = C(1+n,1) * C(2+n,1) * C(4+n,2).
-
A112421: Number of 6 element subsets of {1,2,3,…,n} for which the sum-set has 12 elements.
-
A112447: a(2*n) = A001045(n+2); a(2*n+1) = A001045(n+1).
-
A112469: Partial sums of (-1)^n*Fibonacci(n-1).
-
A112524: a(n) = a(n-1) + 2*n^2 with a(1) = 1.
-
A112539: Half-baked Thue-Morse: at successive steps the sequence or its bit-inverted form is appended to itself.
-
A112553: Expansion of 1/( (1+x^2)*(1-x+x^2) ).
-
A112594: Natural function used for generating x^2 and sqrt(x) only using iteration and Q(x) (the characteristic function of sqrt).
-
A112612: Related to enumeration of branched orientable surface coverings over a non-orientable surface.
-
A112613: Related to enumeration of branched orientable surface coverings over a non-orientable surface.
-
A112627: Decimal equivalent of number defined by last k bits of the infinite binary string …0011001100110011 (numbers with leading zeros omitted).
-
A112651: Numbers k such that k^2 == k (mod 11).
-
A112652: a(n) squared is congruent to a(n) (mod 12).
-
A112653: a(n) squared is congruent to a(n) (mod 13).
-
A112654: Numbers k such that k^3 == k (mod 11).
-
A112655: a(n) cubed is congruent to a(n) (mod 13).
-
A112658: Dean’s Word: Omega 2,1: the trajectory of 0 -> 01, 1 -> 21, 2 -> 03, 3 -> 23.
-
A112689: A modified Chebyshev transform of the Jacobsthal numbers.
-
A112690: Expansion of 1/(1 + x^2 - x^3 - x^5).
-
A112693: Row sums of array A112692.
-
A112696: Partial sum of Catalan numbers A000108 multiplied by powers of 2.
-
A112697: Partial sum of Catalan numbers (A000108) multiplied by powers of 3.
-
A112698: Partial sum of (Catalan numbers A000108 multiplied by powers of 4).
-
A112699: Partial sum of Catalan numbers A000108 multiplied by powers of 5.
-
A112700: Partial sum of Catalan numbers A000108 multiplied by powers of 6.
-
A112701: Partial sum of Catalan numbers (A000108) multiplied by powers of 7.
-
A112702: Partial sum of Catalan numbers A000108 multiplied by powers of 8.
-
A112703: Partial sum of Catalan numbers A000108 multiplied by powers of 9.
-
A112713: Expansion of x/(1 - x + x^5 - x^6).
-
A112727: a(n) is the least integer m greater than one such that m^n is a palindrome.
-
A112742: a(n) = n^2*(n^2 - 1)/3.
-
A112821: Numbers n such that lcm(1,2,3,…,n)/19 equals the denominator of the n-th harmonic number H(n).
-
A112831: Number of non-intersecting cycle systems in a particular directed graph.
-
A112832: Number of non-intersecting cycle systems in a particular directed graph.
-
A112845: Recurrence a(n) = a(n-1)^3 - 3*a(n-1) with a(0) = 6.
-
A112849: Number of congruence classes (epimorphisms/vertex partitionings induced by graph endomorphisms) of undirected cycles of even length: |C(C_{2*n})|.
-
A112851: a(n) = (n-1)*n*(n+1)*(n+2)*(2*n+1)/40.
-
A112865: a(n) = (-1)^(n + floor(n/4) + floor(n/4^2) + …).
-
A112866: If a(n-1) is the i-th Fibonacci number then a(n)=Fibonacci(i+a(n-2)); with a(1)=1, a(2)=2 and where we use the following nonstandard indexing for the Fibonacci numbers: f(n)=f(n-1)+f(n-2), f(1)=1, f(2)=2 (cf. A000045).
-
A112871: Triangle T(h, q) = number of rotes of height h and quench q.
-
A112983: a(n) = 2^(n+1) mod n.
-
A112986: Crossing number of K_{4,n} on the real projective plane.