Skip to content

Summary of block A279

30 sequences
  • A279007: Values tilde(B_s(2)) of q-analogs of Fibonacci numbers.

  • A279019: Least possible number of diagonals of simple convex polyhedron with n faces.

  • A279030: Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 129”, based on the 5-celled von Neumann neighborhood.

  • A279053: Binary representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 131”, based on the 5-celled von Neumann neighborhood.

  • A279054: Largest integer m for which binomial(m,n-1) > binomial(m-1,n).

  • A279075: Maximum starting value of X such that repeated replacement of X with X-ceiling(X/5) requires n steps to reach 0.

  • A279076: Maximum starting value of X such that repeated replacement of X with X-ceiling(X/6) requires n steps to reach 0.

  • A279077: Maximum starting value of X such that repeated replacement of X with X-ceiling(X/7) requires n steps to reach 0.

  • A279078: Maximum starting value of X such that repeated replacement of X with X-ceiling(X/8) requires n steps to reach 0.

  • A279079: Maximum starting value of X such that repeated replacement of X with X-ceiling(X/9) requires n steps to reach 0.

  • A279080: Maximum starting value of X such that repeated replacement of X with X-ceiling(X/10) requires n steps to reach 0.

  • A279085: Number of distinct residues of triangular numbers mod 10^n.

  • A279100: a(n) = Sum_{k=0..n} ceiling(phi^k), where phi is the golden ratio (A001622).

  • A279101: a(n) = Sum_{k=0..n} ceiling((1 + sqrt(2))^k).

  • A279118: Binary representation of the x-axis, from the left edge to the origin, (and also from the origin to the right edge) of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 209”, based on the 5-celled von Neumann neighborhood.

  • A279169: a(n) = floor( 4*n^2/5 ).

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

  • A279260: Numbers which are cyclops palindromic in their binary reflected Gray code representation.

  • A279269: a(n) = floor( (4 + sqrt(11))^n ).

  • A279316: Period 7: repeat [0, 1, 2, 3, 3, 2, 1].

  • A279318: Permutation of the nonnegative integers [6k+3, 6k+2, 6k+1, 6k, 6k+5, 6k+4].

  • A279321: Period 7: repeat [1, 3, 5, 7, 5, 3, 1].

  • A279512: Sierpinski octahedron numbers a(n) = 2*6^n + 3*2^n + 1.

  • A279540: a(0) = 0. For n > 0, a(n) = 10^(a(n-1)).

  • A279607: Beatty sequence for e/2; i.e., a(n) = floor(n*e/2).

  • A279634: Coefficients in the expansion of 1/([r] + [2r]x + [3r]x^2 + …); [ ] = floor, r = 3/2.

  • A279872: Decimal representation of the x-axis, from the left edge to the origin, (and also from the origin to the right edge) of the n-th stage of growth of the two-dimensional cellular automaton defined by “Rule 209”, based on the 5-celled von Neumann neighborhood.

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

  • A279891: Triangle read by rows, T(n,k) = 2*n, with n>=k>=0.

  • A279895: a(n) = n*(5*n + 11)/2.