Summary of block A301
Sequences in block A301
Section titled “Sequences in block A301”-
A301270: Number of labeled trees on n vertices containing two fixed non-adjacent edges.
-
A301291: Expansion of (x^4+3*x^3+x^2+3*x+1)/((x^2+1)*(x-1)^2).
-
A301292: Partial sums of A301291.
-
A301293: Expansion of (x^2+x+1)^2 / ((x^2+1)*(x-1)^2).
-
A301294: Partial sums of A301293.
-
A301298: Expansion of (1 + 4*x + 4*x^2 + 4*x^3 + x^4)/((1 - x)*(1 - x^3)).
-
A301316: a(n) = ((n-1)! + 1) mod n^2.
-
A301347: a(n) = n^(n-1) + (n-1)!.
-
A301383: Expansion of (1 + 3*x - 2*x^2)/(1 - 7*x + 7*x^2 - x^3).
-
A301402: Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
-
A301426: Number of steps required in the worst case for three knights to find the princess in a castle with n rooms arranged in a line (Castle and princess puzzle).
-
A301451: Numbers congruent to {1, 7} mod 9.
-
A301524: Numbers k such that 16*k^k - 1 is prime.
-
A301560: Matching number of the n-odd graph.
-
A301571: Number of vertices at distance 2 from a given vertex in the n-Keller graph.
-
A301575: Circumference of the n X n antelope graph.
-
A301587: Positive integers m such that whenever n is in the range of the Euler totient function, so is m*n.
-
A301647: a(n) = n^3 - (n mod 2).
-
A301653: Expansion of x*(1 + 2*x)/((1 - x)*(1 + x)*(1 - x - x^2)).
-
A301654: Circumference of the n-triangular honeycomb acute knight graph.
-
A301657: Number of nX3 0..1 arrays with every element equal to 0, 1 or 4 horizontally or vertically adjacent elements, with upper left element zero.
-
A301694: Expansion of (1 + 5*x + 4*x^2 + 5*x^3 + x^4)/((1 - x)*(1 - x^3)).
-
A301695: Expansion of (1 + 5*x + 4*x^2 + 5*x^3 + x^4)/((1 - x)^2*(1 - x^3)).
-
A301696: Partial sums of A219529.
-
A301708: Coordination sequence for node of type V1 in “krc” 2-D tiling (or net).
-
A301709: Partial sums of A301708.
-
A301710: Coordination sequence for node of type V2 in “krc” 2-D tiling (or net).
-
A301711: Partial sums of A301710.
-
A301718: Coordination sequence for node of type V2 in “kre” 2-D tiling (or net).
-
A301719: Partial sums of A301718.
-
A301729: a(0)=1; thereafter positive numbers that are congruent to {0, 1, 3, 5} mod 6.
-
A301755: Decimal expansion of 3/8.
-
A301773: Number of odd chordless cycles in the 2n-Moebius ladder graph.
-
A301779: Number of nX3 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally or vertically adjacent elements, with upper left element zero.
-
A301791: Number of 2Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.
-
A301811: Primes of form 3*k^k + 2.
-
A301858: Positive integers which can be written as the sum of two squares but cannot be written as x^2 + y^2 + 2*z^2 with x and y integers and z a nonzero integer.
-
A301860: Number of steps required in the worst case for n knights to find the princess in a castle with rooms arranged in a (n+1) X (n+1) grid (Castle and princess puzzle).
-
A301894: Number of real lines on a smooth real cubic surface.
-
A301926: a(n+3) = a(n) + 24*n + 32, a(0)=0, a(1)=3, a(2)=13.
-
A301960: Number of nX4 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
-
A301973: a(n) = (n^2 - 3*n + 6)*binomial(n+2,3)/4.
-
A301995: Number of nX4 0..1 arrays with every element equal to 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.