Summary of block A245
Sequences in block A245
Section titled “Sequences in block A245”-
A245023: Number of cases of tie (no winner) in the n-person rock-paper-scissors game.
-
A245066: Central terms of triangles A001497 and A001498.
-
A245179: Numbers of the form 2^k+3 or 3*2^k+1, k >= 2.
-
A245206: Odd primes p with E_{p-3}(1/4) == 0 (mod p), where E_n(x) denotes the Euler polynomial of degree n.
-
A245231: Maximum frustration of complete bipartite graph K(n,4).
-
A245288: a(n) = (4*n^2 - 2*n - 1 + (2*n^2 - 2*n + 1)*(-1)^n)/16.
-
A245301: a(n) = n*(7*n^2 + 15*n + 8)/6.
-
A245306: a(n) = Fibonacci(n)^2+1.
-
A245336: Sum of digits of n written in fractional base 8/7.
-
A245338: Sum of digits of n written in fractional base 9/8.
-
A245339: Sum of digits of n written in fractional base 10/9.
-
A245356: Number of numbers whose base-4/3 expansion (see A024631) has n digits.
-
A245391: a(n) = 2^n*binomial(2*(n+1), n).
-
A245467: a(n) = ( 4*n^2 - 2*n + 1 - (2*n^2 - 6*n + 1) * (-1)^n )/16.
-
A245477: Period 6: repeat [1, 1, 1, 1, 1, 2].
-
A245489: a(n) = (1^n + (-2)^n + 4^n)/3.
-
A245490: a(n) = n^(n^3).
-
A245524: a(n) = n^2 - floor(n/2)*(-1)^n.
-
A245534: a(n) = n^2 + floor(n/2)*(-1)^n.
-
A245555: Trajectory of 1 under the morphism 1 -> 12, 2 -> 23, 3 -> 31.
-
A245580: Smallest Lucas number L(m) > L(n) that is divisible by the n-th Lucas number L(n) = A000204(n).
-
A245581: a(n) = (5 * (1 + (-1)^(1 + n)) + 2 * n^2) / 4.
-
A245599: Numbers m with A030101(m) XOR A030109(m) = m for the binary representation of m.
-
A245710: Number of nonzero evil numbers <= n, see A001969.
-
A245738: Number of compositions of n into parts 1 and 2 with both parts present.
-
A245761: Numbers with a maximal multiplicative persistence of 1 in any base.
-
A245762: Maximal number of edges in a C_4 free subgraph of the n-cube.
-
A245764: a(n) = 2*(n^2 + 1) + n*(1 + (-1)^n).
-
A245766: a(n) = 2*(n^2 + 1) - n*(1 + (-1)^n).
-
A245779: Numbers n such that (n/tau(n) - sigma(n)/n) < 1.
-
A245788: n times the number of 1’s in the binary expansion of n.
-
A245804: a(n) = 2*3^n - 3*2^n.
-
A245805: a(n) = 12^n mod 11^n.
-
A245806: a(n) = 3^n + 10^n.
-
A245807: a(n) = 7^n + 10^n.
-
A245827: Szeged index of the grid graph P_3 X P_n.
-
A245828: Szeged index of the grid graph P_n X P_n.
-
A245879: Number of distinct fractional chromatic numbers among all connected graphs on n nodes.
-
A245897: Number of labeled increasing binary trees on 2n-1 nodes whose breadth-first reading word simultaneously avoids 231 and 321.
-
A245898: Number of permutations avoiding 231 that can be realized on increasing unary-binary trees with n nodes.
-
A245900: Number of permutations of [n] avoiding 321 that can be realized on increasing unary-binary trees.
-
A245901: Number of permutations of length 2n-1 avoiding 231 that can be realized on increasing binary trees.
-
A245902: Number of permutations of length 2n-1 avoiding 312 that can be realized on increasing binary trees.
-
A245903: Number of permutations of length 2n-1 avoiding 321 that can be realized on increasing binary trees.
-
A245906: Numbers of the form 4n^2 + 1 or 4n^2 + 8n + 1.
-
A245968: The edge independence number of the Lucas cube Lambda(n).
-
A245990: Number of length n+2 0..3 arrays with no pair in any consecutive three terms totalling exactly 3.
-
A245992: Number of length n+2 0..5 arrays with no pair in any consecutive three terms totalling exactly 5.
-
A245994: Number of length n+2 0..7 arrays with no pair in any consecutive three terms totalling exactly 7.
-
A245996: Number of length 1+2 0..n arrays with no pair in any consecutive three terms totaling exactly n.