Skip to content

Summary of block A262

55 sequences
  • A262000: a(n) = n^2*(7*n - 5)/2.

  • A262011: a(n) = (1/n!) * Product_{k=1..n} (k^3 + 1).

  • A262032: a(n) = (2^n)! / n!.

  • A262033: Number of permutations of [n] beginning with at least floor(n/2) ascents.

  • A262035: Number of permutations of [2n+1] beginning with exactly n ascents.

  • A262139: The first of eight consecutive positive integers the sum of the squares of which is equal to the sum of the squares of nine consecutive positive integers.

  • A262140: The first of nine consecutive positive integers the sum of the squares of which is equal to the sum of the squares of eight consecutive positive integers.

  • A262161: a(n) is the largest term in the continued fraction for a(n-1) + n^2/a(n-1), where a(1)=1.

  • A262184: a(n) = Fibonacci(n)^2 - Fibonacci(n) + 1.

  • A262187: a(n) = (3^n)! / n!.

  • A262221: a(n) = 25*n*(n + 1)/2 + 1.

  • A262236: Number of (n+3) X (1+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits.

  • A262251: Triangular numbers representable as 2^x + 3^y.

  • A262267: Number of (n+2) X (1+2) 0..1 arrays with each row and column divisible by 5, read as a binary number with top and left being the most significant bits.

  • A262279: Smallest m such that A261923(m) = n.

  • A262302: Rainbow index for n-th odd prime.

  • A262303: Length of sequence of lower halves of n: repeatedly apply x->floor(x/2) starting at n; a(n) = number of steps until reach one of 2,3,4.

  • A262326: Number of (n+1) X (2+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.

  • A262333: Number of (n+3) X (1+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits.

  • A262342: Area of Lewis Carroll’s paradoxical F(2n+1) X F(2n+3) rectangle.

  • A262355: Minimal number of circles needed to intersect all the points of an n X n grid.

  • A262361: a(n) = L(L(L(n))), where L(n) are Lucas numbers A000032.

  • A262376: a(n) = Sum_{k=0..n} (k! - k).

  • A262389: Numbers whose last digit is composite.

  • A262402: a(n) = number of triangles that can be formed from the points of a 3 X n grid.

  • A262414: Number of (n+1) X (2+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.

  • A262458: Number of possible conjunction tables in the n-valued logics.

  • A262462: Positive integers k with pi(k^3) a square, where pi(x) denotes the number of primes not exceeding x.

  • A262473: Number of (3+1) X (n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.

  • A262480: Number of trivial c-Wilf equivalence classes in the symmetric group S_n.

  • A262482: Number of (n+3)X(1+3) 0..1 arrays with each row and column divisible by 13, read as a binary number with top and left being the most significant bits.

  • A262490: The index of the first of two consecutive positive triangular numbers (A000217) the sum of which is equal to the sum of four consecutive positive triangular numbers.

  • A262500: Number of binary, minimal instances of Zimin word Z_n that begin with 0.

  • A262523: a(n+3) = a(n) + 6*n + 13, a(0)=0, a(1)=2, a(2)=7.

  • A262534: Numbers k such that phi(k-2) = phi(k-1) = (k-1) / 2.

  • A262543: Number of rooted asymmetrical polyenoids of type U_n* having n edges.

  • A262546: Number of Post functions of n variables which fail to satisfy Post’s second condition.

  • A262564: A politician’s answer to the question “What comes next after 2,3,5?”.

  • A262565: A weaver’s answer to the question “What comes next after 2,3,5?”.

  • A262592: a(n) = (3^(n+1) - 2n^2 + 4n + 5) / 8.

  • A262601: a(n) = n!*(e*Gamma(n,1)*(n-1)+1).

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

  • A262710: Powers of -4.

  • A262714: a(n) = a(n-1)*a(n-2) + 1, with a(0) = a(1) = 2.

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

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

  • A262770: A Beatty sequence: a(n)=floor(n*p) where p=2*cos(Pi/7)=A160389.

  • A262773: A Beatty sequence: a(n)=floor(q*n) where q=A231187.

  • A262779: Binary representation of the n-th iteration of the “Rule 175” elementary cellular automaton starting with a single ON (black) cell.

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

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

  • A262808: Triangle read by rows giving successive states of cellular automaton generated by “Rule 147” initiated with a single ON (black) cell.

  • A262863: Binary representation of the middle column of the “Rule 147” elementary cellular automaton starting with a single ON (black) cell.

  • A262864: Decimal representation of the middle column of the “Rule 147” elementary cellular automaton starting with a single ON (black) cell.

  • A262997: a(n+3) = a(n) + 24*n + 40, a(0)=0, a(1)=5, a(2)=19.