Summary of block A243
Sequences in block A243
Section titled “Sequences in block A243”-
A243004: a(n) = - (a(n-1) + 1) * a(n-2) with a(1) = a(2) = 1.
-
A243013: Number of graphs with n vertices and n-1 edges that can be gracefully labeled.
-
A243014: Number of acyclic digraphs (DAGS) on n labeled nodes, where the indegree and outdegree of each node is at most 1.
-
A243131: a(n) = 16*n^5 - 20*n^3 + 5*n.
-
A243134: 128*n^8 - 256*n^6 + 160*n^4 - 32*n^2 + 1.
-
A243135: 256*n^9 - 576*n^7 + 432*n^5 - 120*n^3 + 9*n.
-
A243138: a(n) = n^2 + 15*n + 13.
-
A243201: Odd octagonal numbers indexed by triangular numbers.
-
A243205: Consider the n X n Go board as a graph; remove i nodes and let j be the number of nodes in the largest connected subgraph remaining; then a(n) = minimum (i + j).
-
A243239: a(n) = 10^n mod 97.
-
A243299: Total number of Bona classes for patterns of length n defined on the set of 123-avoiding permutations.
-
A243302: Consider a triangular Go board graph with side length n; remove i nodes and let j be the number of nodes in the largest connected subgraph remaining; then a(n) = minimum (i + j).
-
A243322: Number of simple connected graphs with n nodes that are distance regular and Eulerian.
-
A243329: Number of simple connected graphs with n nodes that are integral and distance regular.
-
A243339: Number of simple connected graphs with n nodes that are distance regular and K_4 free.
-
A243399: a(0) = 1, a(1) = 19; for n > 1, a(n) = 19*a(n-1) + a(n-2).
-
A243427: Floored (rational) values of sqrt(xy) such that sqrt(x) + sqrt(y) = sqrt(xy).
-
A243513: Number of length n+2 0..4 arrays with no three elements in a row with pattern aba or abb (with a!=b) and new values 0..4 introduced in 0..4 order.
-
A243514: Number of length n+2 0..5 arrays with no three elements in a row with pattern aba or abb (with a!=b) and new values 0..5 introduced in 0..5 order.
-
A243520: Numbers that are congruent to {0, 8} mod 11.
-
A243546: Number of simple connected graphs with n nodes that are distance regular and have no subgraph isomorphic to the bowtie graph.
-
A243554: Number of simple connected graphs with n nodes that are distance-regular and have no subgraph isomorphic to bull graph.
-
A243561: Number of simple connected graphs with n nodes that are distance regular and have no subgraph isomorphic to diamond graph.
-
A243578: Integers n of the form 8k+7 that are sum of distinct squares of the form m, m+1, m+2, m+4, where m == 1 (mod 4).
-
A243579: Integers of the form 8k+7 that can be written as a sum of four distinct squares of the form m, m+2, m+4, m+5, where m == 1 (mod 4).
-
A243580: Integers of the form 8k + 7 that can be written as a sum of four distinct squares of the form m, m + 1, m + 3, m + 5, where m == 2 (mod 4).
-
A243581: Integers of the form 8k + 7 that can be written as a sum of four distinct squares of the form m, m + 2, m + 3, m + 4, where m == 2 (mod 4).
-
A243669: Number of hypo-Sylvester classes of 3-packed words of degree n.
-
A243670: Number of hypo-Sylvester classes of 5-packed words of degree n.
-
A243709: Coxeter numbers of the D-type Niemeier root systems.
-
A243860: a(n) = 2^(n+1) - (n-1)^2.
-
A243869: Expansion of x^4/[(1+x)*Product_{k=1..3} (1-k*x)].
-
A243903: Numbers n such that (number of primes <= n) is greater than or equal to (number of semiprimes <= n).
-
A243989: Rounded down ratio of a lune area and a unit circle one, the lune is bounded by two unit circles whose centers are separated by a distance 1/n.