Skip to content

Summary of block A272

54 sequences
  • A272039: a(n) = 10*n^2 + 4*n + 1.

  • A272066: a(n) = (10^n-1)^3.

  • A272067: a(n) = (10^n-1)^4.

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

  • A272072: Nonnegative integers n such that 10^n is not of the form x^3 + y^3 + z^3 where x > y > z > 0.

  • A272073: Exponents of x in the numerator of cluster variables of a rank 2 cluster algebra.

  • A272100: Integers n that are the sum of three nonzero squares while n*(n+1) is not.

  • A272123: a(n) = Fibonacci(3n) - Fibonacci(2n).

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

  • A272126: a(n) = 120*n^3 + 60*n^2 + 2*n + 1.

  • A272129: a(n) = 32*n^2 - 56*n + 25.

  • A272130: a(n) = 16*n^3 + 10*n^2 + 4*n + 1.

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

  • A272144: Convolution of A000217 and A001045.

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

  • A272168: a(n) = Product_{k=0..n} (k^2-k)!.

  • A272212: Sum of the odd numbers among the larger parts of the partitions of n into two parts.

  • A272263: a(n) = numerator of A000032(n) - 1/2^n.

  • A272297: a(n) = n^4 + 64.

  • A272298: a(n) = n^4 + 324.

  • A272299: a(n) = n + 2*floor(n/2) + 3*floor(n/3).

  • A272341: Numbers n such that 6^n is not of the form (x^3 + y^3 + z^3) / 3 where x > y > z > 0.

  • A272342: a(n) = 27*8^n.

  • A272352: a(n) is the number of ways of putting n labeled balls into 2 indistinguishable boxes such that each box contains at least 3 balls.

  • A272361: Numbers n such that (2^n + 1) / gcd(n, 2^n + 1) is not squarefree.

  • A272378: a(n) = n*(6*n^2 - 8*n + 3).

  • A272381: Primes p == 1 (mod 3) for which A261029(10*p) = 2.

  • A272399: The intersection of hexagonal numbers (A000384) and centered 9-gonal numbers (A060544).

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

  • A272532: Single bit representation of the sum of two sinusoids with periods 2 and 2*sqrt(2).

  • A272574: a(n) = f(9, f(8, n)), where f(k,m) = floor(m*k/(k-1)).

  • A272576: a(n) = f(10, f(9, n)), where f(k,m) = floor(m*k/(k-1)).

  • A272582: The number of strongly connected digraphs with n vertices and n+1 edges.

  • A272589: Numbers n such that the equation F(n) = sigma(F(i) + F(j)) has a solution with i >= 1 and j >= 0, where F(k) = A000045(k) represents the k-th Fibonacci number.

  • A272647: a(n) = A001517(n) mod 7.

  • A272651: The no-3-in-line problem: maximal number of points from an n X n square grid so that no three lie on a line.

  • A272664: (001)(001)(001)(10)*.

  • A272666: a(n) = A011371(n) + 5*n.

  • A272669: A 13-ordering of T = {0,1,2,3,5,8,10,11,12} + 13*Z.

  • A272688: The antibracket constants {x_n}^n.

  • A272690: a(n) = 22*Sum_{i=0..n-2} 46^i*2^(n-2-i) + 2^(n-1).

  • A272696: Coxeter number for the reflection group E_n.

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

  • A272719: Maximal number of steps in a nontouching path on an n X n grid such that each step has a different length.

  • A272764: Number of positive roots in reflection group E_n.

  • A272850: a(n) = (n^2 + (n+1)^2)*(n^2 + (n+1)^2 + 2*n*(n+1)).

  • A272870: Real part of (n + i)^4.

  • A272871: Imaginary part of (n + i)^4.

  • A272912: Difference sequence of the sequence A116470 of all distinct Fibonacci numbers and Lucas numbers (A000032).

  • A272915: a(n) = n + floor(5*n/6).

  • A272930: a(n) is the least k such that sigma(sigma(k)) = n*k, where sigma(n) is the sum of the divisors of n, or 0 if no such k exists.

  • A272931: a(n) = 2^(n+1)*cos(n*arctan(sqrt(15))).

  • A272966: Number of n X n 0..1 arrays with exactly n+n-2 having value 1 and no three 1’s forming an isosceles triangle.

  • A272975: Numbers that are congruent to {0,7} mod 12.