Summary of block A306
Sequences in block A306
Section titled “Sequences in block A306”-
A306150: Row sums of A306015.
-
A306244: Domination number of the n-Menger sponge graph.
-
A306258: a(n) = floor(n^2/4)*n!.
-
A306262: Difference between maximum and minimum sum of products of successive pairs in permutations of [n].
-
A306277: Numbers congruent to 1 or 8 mod 10.
-
A306278: Numbers congruent to 2 or 11 mod 14.
-
A306279: Numbers congruent to 3 or 18 mod 22.
-
A306285: Numbers congruent to 4 or 21 mod 26.
-
A306331: Numbers congruent to 6 or 31 mod 38.
-
A306349: Number of terms in the greedy Egyptian fraction representation of n.
-
A306390: Size of one subtree in the unlabeled binary rooted tree shape of size n whose leaf-labeled trees have the largest number of coalescence sequences.
-
A306472: a(n) = 37*27^n.
-
A306495: Expansion of e.g.f. (2-exp(-x))*exp(x)/(x-1)^2.
-
A306535: Number of permutations p of [2n] having no index i with |p(i)-i| = n.
-
A306589: a(n) is the smallest positive integer that can be written as the sum or difference of exactly n but no fewer powers of 2 and 3.
-
A306635: a(n) = Product_{k=1..n} BarnesG(2*k).
-
A306637: a(n) = Fibonacci(n) * A128834(n).
-
A306666: Positive integers x such that x*(7-5*x+x^2)*(6-4*x+x^2) is a square.
-
A306672: Partial sums of the even Lucas numbers (A014448).
-
A306675: Number of permutations p of [2n] having at least one index i with |p(i)-i| = n.
-
A306771: Numbers m such that m = i + j = i * k and phi(m) = phi(i) + phi(j) = phi(i) * phi(k) for some i, j, k, where phi is the Euler totient function A000010.
-
A306785: Primes p such that p^2 divides A050443(p).
-
A306957: a(n) = n!*binomial(10,n).