Skip to content

Summary of block A269

58 sequences
  • A269019: a(n) = 2^n + 2*(-1)^n - 1.

  • A269025: a(n) = Sum_{k = 0..n} 60^k.

  • A269027: Parity of the number of 1’s in A039724(n).

  • A269028: a(n) = 40*a(n - 1) - a(n - 2) for n>1, a(0) = 1, a(1) = 1.

  • A269044: a(n) = 13*n + 7.

  • A269059: Construct a hollow square of 1’s of side n and fill its interior with 0’s to create a stack of n binary numbers. Express the sum of the stack in decimal.

  • A269100: a(n) = 13*n + 11.

  • A269110: Numbers of unit circles packed in a triangle of smallest area admitting an equilateral triangle solution.

  • A269112: a(n) = (3*(n-1)*n + (-1)^((n-1)*n/2) + 5)/2.

  • A269132: a(n) = n + floor(n*(2*n+1)/5).

  • A269222: Period 4: repeat [1,9,8,9].

  • A269232: a(n) = (n + 1)*(6*n^2 + 15*n + 4)/2.

  • A269237: a(n) = (n + 1)^2*(5*n^2 + 10*n + 2)/2.

  • A269255: a(n) = (2^(2*n+1) - 1)*(3^(n+1) - 1)/2.

  • A269266: a(n) = 2^n mod 31.

  • A269270: Number of n X 2 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three exactly once.

  • A269342: a(n) = (n + 1)*(2*n + 1)*(4*n + 9)/3.

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

  • A269410: Number of length-4 0..n arrays with no repeated value greater than or equal to the previous repeated value.

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

  • A269429: Alternating sum of octagonal pyramidal numbers.

  • A269436: Number of length-4 0..n arrays with no repeated value greater than the previous repeated value.

  • A269445: a(n) = Sum_{k=0..n} floor(k/13).

  • A269457: a(n) = 5*(n + 1)*(n + 4)/2.

  • A269468: Number of length-4 0..n arrays with no repeated value equal to the previous repeated value.

  • A269469: Number of length-5 0..n arrays with no repeated value equal to the previous repeated value.

  • A269486: a(n) = Sum_{j=0..10} (-n)^j.

  • A269495: Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by one.

  • A269500: a(n) = Fibonacci(10*n).

  • A269510: Duplicate of A093907.

  • A269538: Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by other than one.

  • A269560: Length of the longest squarefree and rich word over an alphabet of n letters.

  • A269576: a(n) = Product_{i=1..n} (4^i - 3^i).

  • A269584: Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by more than one.

  • A269607: Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by one or less.

  • A269620: Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by other than plus two, zero or minus 1.

  • A269641: Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by other than plus two or minus 1.

  • A269657: Number of length-4 0..n arrays with no adjacent pair x,x+1 repeated.

  • A269658: Number of length-5 0..n arrays with no adjacent pair x,x+1 repeated.

  • A269661: a(n) = Product_{i=1..n} (5^i - 4^i).

  • A269694: Product of first n nonzero Jacobsthal numbers (A001045).

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

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

  • A269721: Integers k such that k, k+2, k+4 and k+6 are prime powers (A000961).

  • A269723: Start with A_0 = 0, then extend by setting B_k = complement of A_k and A_{k+1} = A_k A_k B_k B_k; sequence is limit of A_k as k -> infinity.

  • A269760: Number of n X 1 0..5 arrays with some element plus some horizontally or vertically adjacent neighbor totalling five exactly once.

  • A269792: a(n) = 5*n^4.

  • A269796: a(n) = 4^n * A000108(n+1).

  • A269803: a(n) = F(n+1)*F(n+2) - F(n), where F = A000045 (Fibonacci numbers).

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

  • A269819: Numbers that are congruent to {5, 11, 13, 19} mod 24.

  • A269822: Number of n X 1 0..4 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling four exactly once.

  • A269834: Primes p of the form 2^k + 9*(-1)^k - 8.

  • A269836: Primes p of the form k^(2*k) + 1.

  • A269895: Number of n X 1 0..6 arrays with some element plus some horizontally or vertically adjacent neighbor totalling six exactly once.

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

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

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