Summary of block A270
Sequences in block A270
Section titled “Sequences in block A270”-
A270003: Least prime p such that n = p + q - r for some primes q and r with q > p.
-
A270010: Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by “Rule 7”, based on the 5-celled von Neumann neighborhood.
-
A270059: Number of distinct digits needed to write n in all bases >= 2.
-
A270109: a(n) = n^3 + (n+1)*(n+2).
-
A270111: Number of n X 1 0..7 arrays with some element plus some horizontally or vertically adjacent neighbor totalling seven exactly once.
-
A270126: Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by “Rule 86”, based on the 5-celled von Neumann neighborhood.
-
A270204: a(n) = n^12 - n^10 + n^8 - n^6 + n^4 - n^2 + 1.
-
A270205: Number of 2 X 2 planar subsets in an n X n X n cube.
-
A270222: Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by “Rule 131”, based on the 5-celled von Neumann neighborhood.
-
A270257: Number of 2X2X2 triangular 0..n arrays with some element plus some adjacent element totalling n exactly once.
-
A270296: Numbers which are representable as a sum of five but no fewer consecutive nonnegative integers.
-
A270369: Expansion of g.f. (1-7*x)/(1-9*x).
-
A270388: a(n) = A048739(n-2) mod n.
-
A270444: Expansion of 2*(1+2*x) / (1-8*x+4*x^2).
-
A270445: Expansion of 2*x*(1+4*x) / (1-12*x+16*x^2).
-
A270454: Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by “Rule 163”, based on the 5-celled von Neumann neighborhood.
-
A270456: First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by “Rule 163”, based on the 5-celled von Neumann neighborhood.
-
A270471: Expansion of g.f. (1-3*x)/(1-7*x).
-
A270472: Expansion of g.f. (1-2*x)/(1-9*x).
-
A270473: Expansion of g.f. (1-5*x)/(1-9*x).
-
A270510: Number of 2X2X2 triangular 0..n arrays with some element plus some adjacent element totalling n+1 exactly once.
-
A270545: Number of equilateral triangle units forming perimeter of equilateral triangle.
-
A270567: Expansion of g.f. (1+4*x)/(1-5*x).
-
A270568: Expansion of g.f. (1+4*x)/(1-8*x).
-
A270576: Expansion of g.f. (1+2*x)/(1-6*x).
-
A270638: Number of novel integer partitions with n parts.
-
A270700: Triangular Star of David numbers (the figurate number of triangles framing a hexagram: a(0) = 12; thereafter a(n) = 36*n + 6).
-
A270704: Even 14-gonal (or tetradecagonal) numbers.
-
A270710: a(n) = 3*n^2 + 2*n - 1.
-
A270740: Period 9: repeat 0,1,2,2,0,1,1,2,0.
-
A270743: Runlength sequence of the zero-one sequence A270742.
-
A270797: a(n) = J(n) if n odd, or 4*J(n) if n even, where J = Jacobsthal numbers A001045.
-
A270809: a(n) = n^3/3 - 7*n/3 + 4.
-
A270810: Expansion of (x - x^2 + 2*x^3 + 2*x^4)/(1 - 3*x + 2*x^2).
-
A270841: a(1) = 5; a(n) is the sum of |a(m) - m| for m < n.
-
A270867: a(n) = n^3 + 2*n^2 + 4*n + 1.
-
A270868: a(n) = n^4 + 3*n^3 + 8*n^2 + 9*n + 2.
-
A270889: Integers n such that the circular graph C_n has a square size deficiency.