Skip to content

Summary of block A333

13 sequences
  • A333132: a(n) = n for n <= 3; thereafter a(n) = 2^(a(n-1)-1) + a(n-1).

  • A333344: a(n) = 11*a(n-1) - 9*a(n-2) starting a(0)=1, a(1)=10.

  • A333378: a(n) = F(n) * (-1)^(n*(n-1)/2) where F(n) = A000045(n) Fibonacci numbers.

  • A333385: a(n) = 3^n + 2 * 17^n for n >= 0.

  • A333470: Lexicographically earliest sequence of distinct positive terms such that a(n) is the number of commas that a(n) has to step over (to the right) to be met by an odd term. This odd term might not be the closest odd term to a(n).

  • A333525: Degree of polytope representing the number n.

  • A333547: Indices of records in A332580.

  • A333574: Number of Hamiltonian paths in the n X 2 grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.

  • A333588: a(n) = floor(-(3/2)*a(n-1)), a(1)=-2.

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

  • A333718: a(n) = L(8*n+4)/7, where L=A000032 (the Lucas sequence).

  • A333772: a(n) = n * 2^n * (n!)^2.

  • A333841: Integers n such that n! = x^2 + y^3 + z^4 where x, y and z are nonnegative integers, is soluble.