Summary of block A345
Sequences in block A345
Section titled “Sequences in block A345”-
A345019: Numbers whose last digit is refactorable.
-
A345021: a(n) is the result of replacing 2’s by 0’s in the hereditary base-2 expansion of n.
-
A345339: a(n) = 18*n + 20.
-
A345360: a(n) = n^n*n - n.
-
A345438: Number of primes in the ring R = {x+y*sqrt(-2): x, y rational integers} with norm x^2+2*y^2 equal to A341784(n).
-
A345443: a(n) = smallest m such that for every red-blue edge-coloring of the graph K_{m,m} there exists either a red 4-cycle or a blue K_{1,n}.
-
A345445: a(n) = n^n - (n+1)!/2.
-
A345685: a(n) is the smallest cardinality of all covering sets associated with Riesel number A101036(n).
-
A345701: a(n) = 3*n^3 - 1.
-
A345702: Numbers that can be written as 2*a^2 - 1 and 3*b^3 - 1.
-
A345735: A prime-generating quasipolynomial: a(n) = 6*floor(n^2/4) + 17.
-
A345887: Number of tilings of an n-cell circular array with rectangular tiles of any size, and where the number of possible colors of a tile is given by the largest cell covered.
-
A345889: Number of tilings of an n-cell circular array with rectangular tiles of any size, and where the number of possible colors of a tile is given by the smallest cell covered.
-
A345900: Integers e such that each of q-1, q + sqrt(2*q) + 1 and q - sqrt(2*q) + 1 are either a power of prime or a semiprime, where q = 2^(2*e+1).
-
A345963: a(n) = (q^2-q+1)/3 where q = 2^(2*n+1) = A004171(n).
-
A345981: a(n) = integral spum of a path P_n.
-
A345986: Numbers k > 0 such that the k-th power of the Dedekind eta-function is lacunary.