Summary of block A347
Sequences in block A347
Section titled “Sequences in block A347”-
A347289: Number of independent sets in the binomial tree of order n.
-
A347319: a(n) = (2*n+1)*(n^3-2*n^2+n+1).
-
A347365: a(n) = n * (2-(-1)^n), or zero together with first differences of even triangular numbers halved (A074378).
-
A347478: Number of total dominating sets in the n-alkane graph.
-
A347507: Number of dominating sets in the odd graph O_n.
-
A347511: Number of minimal dominating sets in the n-Apollonian network.
-
A347512: Number of minimal dominating sets in the n-book graph.
-
A347513: Number of minimal dominating sets in the n-cycle complement graph.
-
A347523: Characteristic function of nonpowers of 2.
-
A347536: Number of minimum dominating sets in the complete tripartite graph K_{n,n,n}.
-
A347553: Number of minimum dominating sets in the n-cycle complement graph.
-
A347581: The Barnyard sequence: a(n) is the minimum number of unit length line segments required to enclose areas of 1 through n on a square grid.
-
A347651: Total domination number of the n-Sierpinski carpet graph.
-
A347670: Number of irredundant sets in the n-Apollonian network.
-
A347671: a(n) = n^n mod 100.
-
A347701: Rightmost diagonal of A347700.
-
A347789: a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks.
-
A347790: Domination number of the n-transposition graph.
-
A347792: Beatty sequence for 2^(2/3).
-
A347836: a(n) = 8*(n + floor(n/3)) - 3; second column of A347834.
-
A347837: a(n) = 32*(n + floor(n/3)) - 11; third column of A347834.
-
A347838: Positive numbers that are congruent to 2, 5, or 11 modulo 12.
-
A347920: Number of minimal total dominating sets in the n-gon diagonal intersection graph.
-
A347923: Number of minimal total dominating sets in the n-folded cube graph.
-
A347941: For sets of n random points in the real plane, a(n) is an upper bound for the minimal number of nearest neighbors.