Summary of block A071
Sequences in block A071
Section titled “Sequences in block A071”-
A071028: Triangle read by rows giving successive states of cellular automaton generated by “Rule 50”.
-
A071045: Number of 0’s in n-th row of triangle in A071030.
-
A071054: a(2n)=3n+1, a(2n+1)=2n+2.
-
A071071: Minimal “powers of 2” set in base 10: any power of 2 contains at least one term of this sequence in its decimal expansion.
-
A071099: a(n) = (n-1)*(n+3) - 2^n + 4.
-
A071219: Numbers m such that the largest prime factor of prime(m) + prime(m+1) equals m.
-
A071229: a(n) = n*(14*n^2 - 21*n + 13)/6.
-
A071230: a(n) = n*(6*n^2 - 7*n + 3)/2.
-
A071231: a(n) = (n^8 + n^4)/2.
-
A071232: a(n) = (n^6 + n^3)/2.
-
A071233: a(n) = 2*(n-1)*(n^2 + 1).
-
A071235: a(n) = (n^12 + n^6)/2.
-
A071236: a(n) = (n^10 + n^5)/2.
-
A071237: a(n) = n*(n+1)*(n^2+1)/2.
-
A071238: a(n) = n*(n+1)*(2*n^2+1)/6.
-
A071239: a(n) = n*(n+1)*(n^2 + 2)/6.
-
A071244: a(n) = n*(n-1)*(n^2 + 2)/6.
-
A071245: a(n) = n*(n-1)*(2*n^2 + 1)/6.
-
A071246: a(n) = n*(n - 1)*(2*n^2 + n + 2)/6.
-
A071252: a(n) = n*(n - 1)*(n^2 + 1)/2.
-
A071253: a(n) = n^2*(n^2+1).
-
A071270: a(n) = n^2*(2*n^2 + 1)/3.
-
A071279: Kissing number of regular n-gon.
-
A071282: Denominators of Peirce sequence of order 3.
-
A071289: a(n) = n*(n^2 + 1) if n is even, otherwise (n - 1/2)*(n^2 + 1).
-
A071408: a(n+1) - 2*a(n) + a(n-1) = (2/3)*(1 + w^(n+1) + w^(2*n+2)) with a(1)=0, a(2)=1, and where w is the imaginary cubic root of unity.
-
A071423: a(n) = a(n-1) + number of decimal digits of 2^n. Number of decimal digits of concatenation of first n powers of 2.
-
A071536: Number of extensions to a semigroup of the (categorical) composition of arrows in the complete directed graph on n labeled nodes.
-
A071539: Number of n-tuples of elements e_1,e_2,…,e_n in the symmetric group S_3 such that the subgroup generated by e_1,e_2,…,e_n is S_3.
-
A071568: Smallest k>n such that n^3+1 divides k*n^2+1.
-
A071579: a(n) = 2*a(n-1)*A002812(n-1), starting a(0)=1.
-
A071618: a(n+1) - 3*a(n) + a(n-1) = (2/3)(1+w^(n+1)+w^(2n+2)), where w = exp(2 Pi I / 3).
-
A071619: a(n) = ceiling(2*n^2 / 3).
-
A071636: Numbers n=4*k+2 such that there is no pair of primes p and q of form 4*i+1 with p+q=n; A071635(n)=0.
-
A071679: Least k such that the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, …, k/k equals n.
-
A071713: a(n) = smallest value of |x^n + y^n + z^n| for x,y,z distinct nonzero integers.
-
A071720: Number of spanning trees in K_{n}-e, the complete graph on n nodes minus an edge (n > 1).
-
A071765: Number of n-tuples of elements e_1,e_2,…,e_n in the alternating group A_4 such that the subgroup generated by e_1,e_2,…,e_n is A_4.
-
A071781: Primes p with p-2^e and p+2^e prime for some exponent e.
-
A071797: Restart counting after each new odd integer (a fractal sequence).
-
A071858: (Number of 1’s in binary expansion of n) mod 3.
-
A071881: Number of different primitive polyhedral types of Voronoi regions of n-dimensional point lattices.
-
A071887: Conjectured values of n whose trajectory under map x -> A002487(x)*A002487(x+1) does not go into a cycle.
-
A071900: 1/4 times the number of n X n 0..7 matrices with MM’ mod 8 = I, where M’ is the transpose of M and I is the n X n identity matrix.
-
A071910: a(n) = t(n)*t(n+1)*t(n+2), where t() are the triangular numbers.
-
A071930: Number of words of length 2n in the two letters s and t that reduce to the identity 1 by using the relations ssTT=1, ststSS=1 and ststTT=1, where S and T are the inverses of s and t, respectively (i.e., sS=1 and tT=1). The generators s and t and the three stated relations generate the quaternion group Q4.
-
A071934: a(n) = Sum_{i=1..n} K(i+1,i), where K(x,y) is the Kronecker symbol (x/y).
-
A071954: a(n) = 4*a(n-1) - a(n-2) - 4, with a(0) = 2, a(1) = 4.