Summary of block A058
Sequences in block A058
Section titled “Sequences in block A058”-
A058006: Alternating factorials: 0! - 1! + 2! - … + (-1)^n n!
-
A058031: a(n) = n^4 - 2*n^3 + 3*n^2 - 2*n + 1, the Alexander polynomial for reef and granny knots.
-
A058038: a(n) = Fibonacci(2*n)*Fibonacci(2*n+2).
-
A058051: a(n) = F(F(F(n))), where F is a Fibonacci number (A000045).
-
A058065: Complement of A057843.
-
A058066: a(n) = floor(n*t), t = 1 + sqrt(5)/2.
-
A058126: a(n) = n^n - n^2 with 0^0=1.
-
A058181: Quadratic recurrence a(n) = a(n-1)^2 - a(n-2) for n >= 2 with a(0) = 1 and a(1) = 0.
-
A058182: a(n) = a(n-1)^2 + a(n-2) for n >= 2 with a(0) = 1 and a(1) = 0.
-
A058187: Expansion of (1+x)/(1-x^2)^4: duplicated tetrahedral numbers.
-
A058201: Erroneous version of A064513.
-
A058211: Numbers k such that there is an arrangement of k points in the plane such that no point is on >= k/2 connecting lines.
-
A058212: a(n) = 1 + floor(n*(n-3)/6).
-
A058224: Largest d such that the linear programming bound for quantum codes of length n is feasible for some real K>1.
-
A058227: Number of edges in all simple (loopless) paths, connecting any node with all the remaining ones in optimal graphs of degree 4.
-
A058310: (1/2)*(n^2+n+2)*(n^2+3*n+1).
-
A058331: a(n) = 2*n^2 + 1.
-
A058333: Number of 3 X 3 matrices with elements from [0,…,(n-1)] satisfying the condition that the middle element of each row or column is the difference of the two end elements (in absolute value).
-
A058372: a(n) = -(n + 1)*(2*n^2 + n - 12)/6.
-
A058396: Expansion of ((1-x)/(1-2*x))^3.
-
A058481: a(n) = 3^n - 2.
-
A058488: Total number of interior nodes in all essentially parallel series-parallel networks with n unlabeled edges, multiple edges not allowed.
-
A058522: a(1) = a(2) = 1; a(n+2) = a(n+1) + a(n+1)^a(n).
-
A058581: (4*n^2+2*n-3)*(2*n-1)*n/3.
-
A058582: Expansion of (1+3*x+4*x^2)/(1-4*x^2+4*x^4).
-
A058635: a(n) = Fibonacci(2^n).
-
A058642: Number of unlabeled graphs with n edges, no nodes of degree 1 or 2, no multiple edges and no cut nodes, under “series-equivalence”.
-
A058645: a(n) = 2^(n-3)*n^2*(n+3).
-
A058667: 2^(n-2)*n*(n+2)!/3.
-
A058668: Number of unlabeled graphs with n edges, no nodes of degree 1 and no cut nodes, under “series-equivalence”; multiple edges are allowed.
-
A058759: Shannon switching function: a(n) is the least number k such that any switching (or Boolean) function of n variables can be realized as a two-terminal network of AND’s and OR’s in which the total number of occurrences of the variables X_1, X_1’, …, X_n, X_n’ is no more than k (where the primes indicate complements).
-
A058794: Row 3 of A007754.
-
A058795: Row 4 of A007754.
-
A058809: The sequence lambda(3,n), where lambda is defined in A055203. Number of ways of placing n identifiable positive intervals with a total of exactly three starting and/or finishing points.
-
A058877: Number of labeled acyclic digraphs with n nodes containing exactly n-1 points of in-degree zero.
-
A058881: Erroneous version of A051504.
-
A058891: a(n) = 2^(2^(n-1) - 1).
-
A058895: a(n) = n^4 - n.
-
A058896: a(n) = 4^n - 4.
-
A058917: Number of elements required for synthesis of rational function of degree n by “half-n” Miyata method.
-
A058918: Number of elements required for synthesis of rational function of degree n by modified Bott and Duffin method.
-
A058919: a(n) = n^4/2 - n^3 + 3*n^2/2 - n + 1 = (n^2 + 1)*(n^2 - 2*n + 2)/2.
-
A058920: a(n) = 2*n^4 + 2*n^3 + 3*n^2 + 2*n + 1.
-
A058922: a(n) = n*2^n - 2^n = 2^n*(n-1).
-
A058932: Number of unlabeled claw-free cubic graphs with 2n nodes and connectivity 1.
-
A058937: Maximal exponent of x in all terms of Somos polynomial of order n.
-
A058962: a(n) = 2^(2*n)*(2*n+1).
-
A058966: a(3) = 1, otherwise a(n) = n*2^(n-3) - 2^(n-2) - 2.
-
A058968: a(n) = 2^n + 2^(n - 1) - n - 8.
-
A058986: Sorting by prefix reversal (or “flipping pancakes”). You can only reverse segments that include the initial term of the current permutation; a(n) is the number of reversals that are needed to transform an arbitrary permutation of n letters to the identity permutation.
-
A058992: Gossip Problem: there are n people and each of them knows some item of gossip not known to the others. They communicate by telephone and whenever one person calls another, they tell each other all that they know at that time. How many calls are required before each gossip knows everything?