Summary of block A308
Sequences in block A308
Section titled “Sequences in block A308”-
A308123: Sum of the perimeters of all integer-sided isosceles triangles with perimeter n.
-
A308124: a(n) = (2 + 7*4^n)/3.
-
A308136: Number of (undirected) Hamiltonian paths in the 2n-crossed prism graph.
-
A308196: Partial sums of A063808.
-
A308215: a(n) is the multiplicative inverse of A001844(n+1) modulo A001844(n); where A001844 is the sequence of centered square numbers.
-
A308305: a(n) = s(n,n) + s(n,n-1) + s(n,n-2), where s(n,k) are the unsigned Stirling numbers of the first kind (see A132393).
-
A308347: n-th digit in the base-6 expansion of 1/n.
-
A308349: Number of minimal unit-distance forbidden graph minors on n vertices.
-
A308358: Beatty sequence for sqrt(3)/4.
-
A308374: Number of maximal irredundant sets in the n X n X n grid graph.
-
A308385: a(n) is the last square visited by fers moves on a spirally numbered (2n-1) X (2n-1) board, moving to the lowest available unvisited square at each step.
-
A308422: a(n) = n^2 if n odd, 3*n^2/4 if n even.
-
A308434: n! + n!!.
-
A308579: a(n) = (9*2^n - 6*n - 10)/2.
-
A308580: a(n) = 3*2^n + n^2 - n.
-
A308585: a(n) = 2^(n + 3) - 10*n - 6.
-
A308602: Number of (not necessarily maximal) cliques in the n-cycle graph.
-
A308603: Number of (not necessarily maximal) cliques in the n-dipyramidal graph.
-
A308606: Number of (not necessarily maximal) cliques in the n-transposition graph.
-
A308607: Number of (not necessarily maximal) cliques in the wheel graph on n vertices.
-
A308632: Largest aggressor for the maximum number of peaceable coexisting queens as given in A250000.
-
A308657: Smallest number that is nontrivially palindromic in n consecutive number bases.
-
A308700: a(n) = n * 2^(n - 2) * (2^(n - 1) - 1).
-
A308807: a(n) = 4*5^(n-1) + n.
-
A308876: Expansion of e.g.f. exp(x)*(1 - x)/(1 - 2*x).