Skip to content

Summary of block A271

59 sequences
  • A271017: Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by “Rule 251”, based on the 5-celled von Neumann neighborhood.

  • A271060: Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by “Rule 261”, based on the 5-celled von Neumann neighborhood.

  • A271061: Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by “Rule 261”, based on the 5-celled von Neumann neighborhood.

  • A271064: First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by “Rule 261”, based on the 5-celled von Neumann neighborhood.

  • A271114: Expansion of (1+x)*(2+x)/(1-x)^2.

  • A271208: a(n) = n^5 + n - 1.

  • A271209: a(n) = n^5 + n + 1.

  • A271317: Fibonacci(n) divides the n-th primorial.

  • A271324: a(n) = n + floor(n/4) + (n mod 4).

  • A271350: a(n) = 3^n mod 83.

  • A271351: a(n) = 3^n mod 131.

  • A271352: a(n) = 3^n mod 211.

  • A271357: a(n) = k*Fibonacci(2*n+1) + (k+1)*Fibonacci(2*n), where k=3.

  • A271358: a(n) = k*Fibonacci(2*n+1) + (k+1)*Fibonacci(2*n), where k=4.

  • A271359: a(n) = k*Fibonacci(2*n+1) + (k+1)*Fibonacci(2*n), where k=5.

  • A271378: a(n) = 5^n mod 31.

  • A271379: a(n) = 5^n mod 101.

  • A271380: a(n) = 5^n mod 163.

  • A271385: a(n) = Product_{k=0..floor((n - 1)/2)} (n - 2*k)^(n - 2*k).

  • A271391: Expansion of (1 + x + 2*x^2 + 6*x^3 + x^4 + x^5)/(1 - x^2)^3.

  • A271393: a(1) = 3, a(n+1) = (3^a(n)-1)/2.

  • A271427: a(n) = 7^n - a(n-1) for n>0, a(0)=0.

  • A271438: Numbers n such that the number formed by concatenating in ascending order the first n multidigit palindromic primes is prime.

  • A271449: Greatest number of edges in a simple polygon on an n X n grid with no two edges parallel or perpendicular.

  • A271476: Total number of burnt pancakes flipped using the Min-bar(n) greedy algorithm.

  • A271478: If n is even, a(n)=n/2, otherwise 2*n+2.

  • A271480: Dimension of n-qubit subspace H^{MPS}_{2,n} for bond dimension 2.

  • A271490: Size of maximal subset of points of n X n grid such that no two points are at the same distance.

  • A271494: Expansion of (1+16*x)/((1+4*x)*(1-8*x)).

  • A271508: Numbers that are congruent to {1,4} mod 10.

  • A271527: a(n) = 1000^n + 1.

  • A271535: a(n) = ( n*(n + 1)*(2*n + 1)/6 )^2.

  • A271551: a(0) = 0, a(n) = a(n-1)[n-1]a(n-1).

  • A271553: a(n) = H_{n-1}(n,n).

  • A271572: a(n) = n^7 mod 32.

  • A271624: a(n) = 2*n^2 - 4*n + 4.

  • A271625: a(n) = = 2*(n+1)^2 - 5.

  • A271636: a(n) = 4*n*(4*n^2 + 3).

  • A271649: a(n) = 2*(n^2 - n + 2).

  • A271675: Numbers m such that 3*m + 4 is a square.

  • A271676: Prime powers k such that 3k + 4 is a perfect square.

  • A271713: Numbers n such that 3*n - 5 is a square.

  • A271723: Numbers k such that 3*k - 8 is a square.

  • A271740: a(n) = 3*n^2 - 2*n + 2.

  • A271743: Number of set partitions of [n] such that 4 is the largest element of the last block.

  • A271771: Maximum total Hamming distance between pairs of consecutive elements in any permutation of all 2^n binary words of length n.

  • A271779: a(n) = n^3 + 2*n^2 + 5*n + 11.

  • A271828: a(n) = 4*n^3 - 18*n^2 + 27*n - 12.

  • A271830: Expansion of (3 - 4*x + 3*x^2 + x^4)/((1 - x)^2*(1 + x^2 + x^4)).

  • A271876: Numbers n such that 3^n is not of the form x^3 + y^3 + z^3 where x, y, z > 0.

  • A271906: Size of the largest subset S of the points of an n X n square grid such that no three of the points of S form a right isosceles triangle.

  • A271907: Size of the largest subset S of the points of an n X n square grid such that no three of the points of S form an isosceles triangle.

  • A271911: Number of ways to choose three distinct points from a 2 X n grid so that they form an isosceles triangle.

  • A271937: a(n) = (7/4)*n^2 + (5/2)*n + (7 + (-1)^n)/8.

  • A271938: a(1) = 1, a(2) = 3, a(n) = a(n-1)^a(n-2).

  • A271939: Number of edges in the n-th order Sierpinski carpet graph.

  • A271946: a(n) = Product_{k=0..n} (6*k)!.

  • A271947: a(n) = Product_{k=0..n} (7*k)!.

  • A271972: Expansion of (1 + 3*x)/(1 - 4*x + 7*x^2).