Summary of block A337
Sequences in block A337
Section titled “Sequences in block A337”-
A337001: a(n) = n! * Sum_{k=0..n} k^3 / k!.
-
A337002: a(n) = n! * Sum_{k=0..n} k^4 / k!.
-
A337024: Number of ways to tile a 2n X 2n square with 1 X 1 white and n X n black squares.
-
A337025: Number of n-state 2-symbol halt-free Turing machines.
-
A337099: Largest positive number using exactly n segments on a calculator display (when ‘6’ and ‘7’ are represented using 6 resp. 3 segments).
-
A337118: Number of Morita equivalence classes of blocks with defect group (C_2)^n.
-
A337130: a(n) is the sum of all products of pairs of numbers joined by the diagonals of an n-gon when its vertices are numbered from 1 to n in order.
-
A337152: a(n) = 2^n * (n!)^2 * Sum_{k=0..n} 1 / ((-2)^k * (k!)^2).
-
A337153: a(n) = 3^n * (n!)^2 * Sum_{k=0..n} 1 / ((-3)^k * (k!)^2).
-
A337154: a(n) = 4^n * (n!)^2 * Sum_{k=0..n} 1 / ((-4)^k * (k!)^2).
-
A337172: Numbers k such that L(k+2)^L(k) mod L(k+1) is a Lucas number, where L = A000032.
-
A337261: Numbers k such that the digits of 4^k cannot be rearranged to form the digits of t^2, for t not a power of 2.
-
A337300: Partial sums of the geometric Connell sequence A049039.
-
A337483: Number of ordered triples of positive integers summing to n that are either weakly increasing or weakly decreasing.
-
A337484: Number of ordered triples of positive integers summing to n that are neither strictly increasing nor strictly decreasing.
-
A337501: Minimum number of painted cells in an n X n grid to avoid unpainted trominoes.
-
A337502: Minimum number of painted cells in an n X n grid to avoid unpainted tetrominoes.
-
A337519: Length of the shortest walk in an n X n grid graph that starts in one corner and visits every edge.
-
A337638: Consider the Conant Gasket G_{2n}, as in A328080; a(n) = area of largest cell when G_{2n} is drawn on a scale at which the smallest cell has area 1.
-
A337639: Consider the Conant Gasket G_{2n+1}, as in A328078; a(n) = area of largest cell when G_{2n+1} is drawn on a scale at which the cells along the base have width 1/2.
-
A337851: a(n) = (2^n + 2)^n.
-
A337852: a(n) = (2^(n+1) + 1)^n.
-
A337855: Number of n-digit positive integers that are the product of two integers ending with 5.
-
A337909: Distinct terms of A080079 in the order in which they appear.
-
A337928: Numbers w such that (F(2n+1)^2, -F(2n)^2, -w) are primitive solutions of the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 1, where F(n) is the n-th Fibonacci number (A000045).
-
A337929: Numbers w such that (F(2*n-1)^2, -F(2*n)^2, w) are primitive solutions of the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 1, where F(n) is the n-th Fibonacci number (A000045).
-
A337985: a(n) is the exponent of the highest power of 2 dividing the n-th Bell number.