Summary of block A309
Sequences in block A309
Section titled “Sequences in block A309”-
A309006: Product minus sum of the two previous terms in the sequence, with a(1) = 2 and a(2) = 5.
-
A309009: Numbers that are both triangular and octahedral.
-
A309071: Complete list of solutions to y^2 = x^3 + 20*x; sequence gives x values.
-
A309088: a(n) is the number of isotopy classes of order n Latin squares that produce a unique determinant.
-
A309093: The analog of A309077(n), but allowing fractional powers.
-
A309115: Minimal linear spaces with n nontrivial lines.
-
A309146: Least k such that the rank of the elliptic curve y^2 = x^3 + (k^2 - 6*k - 3)*x^2 + 16*k*x is n.
-
A309147: Least k such that the rank of the elliptic curve y^2 = x^3 + (k^2 + 6*k - 3)*x^2 - 16*k*x is n.
-
A309170: Least nonnegative integer k such that the rank of the elliptic curve y^2 = x^3 + (4*k^2 + 12*k - 3)*x^2 + 32*(k+3)*x is n.
-
A309212: Nearest integer to (4/3)^n.
-
A309214: a(0)=0; thereafter a(n) = a(n-1)+n if a(n-1) even, otherwise a(n) = a(n-1)-n.
-
A309215: a(0)=0; thereafter a(n) = a(n-1)+n if a(n-1) odd, otherwise a(n) = a(n-1)-n.
-
A309294: (1/2) times the sum of the elements of all subsets of [n] whose sum is divisible by two.
-
A309327: a(n) = Product_{k=1..n-1} (4^k + 1).
-
A309330: Numbers k such that 10*k^2 + 40 is a square.
-
A309337: a(n) = n^3 if n odd, 3*n^3/4 if n even.
-
A309345: a(n) is the minimum number of transversals in Latin squares of order n that have at least 1 transversal.
-
A309370: Maximum size of a Sidon subset of {0,1}^n.
-
A309372: a(n) = n^2 - n^3 + n^4.
-
A309418: The number of types of extreme rigid honeycombs of weight n.
-
A309442: Minimum number of colors needed to color the cells of the six regular convex polychora such that no two cells with a common face share the same color (in the order 5-cell, 8-cell, 16-cell, 24-cell, 120-cell, 600-cell).
-
A309472: a(n) = n^n - n * n!.
-
A309490: Total number of adjacent node merge operations to turn a circular list of size n to a node.
-
A309514: Number of winning Tak paths on an n X n board.
-
A309579: Maximum principal ratio of a strongly connected digraph on n nodes.
-
A309675: a(n) = 4^n^2 + n!.
-
A309683: Number of odd parts appearing among the smallest parts of the partitions of n into 3 parts.
-
A309685: Number of even parts appearing among the smallest parts of the partitions of n into 3 parts.
-
A309687: Number of odd parts appearing among the second largest parts of the partitions of n into 3 parts.
-
A309689: Number of even parts appearing among the second largest parts of the partitions of n into 3 parts.
-
A309779: Squares that can be expressed as the sum of two positive squares but not as the sum of three positive squares.
-
A309789: Numbers n such that -1 + Sum_{k=1..n} prime(k)! is prime, where prime(k) is the k-th prime.
-
A309827: a(n) is the square of the number consisting of one 1 and n 6’s: (166…6)^2.
-
A309842: a(n) is the total surface area of a hollow cubic block (defined as a block with a shell thickness of 1 cube) where n is the edge length of the removed volume.
-
A309874: a(n) = 2*n*Fibonacci(n-2) + (-1)^n + 1.
-
A309878: The real part of b(n) where b(n) = (n + b(n-1)) * (1 + i) with b(-1)=0; i = sqrt(-1).
-
A309885: a(n) is the largest integer k such that there exists a set of n integers from which each number in 1,…,k can be built using the basic operations +,-,*,/, with parentheses allowed, and using each element of the set exactly once.
-
A309889: a(n) is the maximal number of regions in the Euclidean plane made by superimposing a simple n-gon onto the resulting plane figure of a(n-1).
-
A309907: a(n) is the square of the number consisting of one 1 and n 3’s: (133…3)^2.
-
A309970: Period 12: repeat [1, 1, 0, 0, -1, -1, -1, -1, 0, 0, 1, 1].