Skip to content

Summary of block A050

44 sequences
  • A050140: a(n) = 2*floor(n*phi)-n, where phi = (1+sqrt(5))/2.

  • A050187: a(n) = n * floor((n-1)/2).

  • A050188: T(n,3), array T as in A050186; a count of aperiodic binary words.

  • A050271: Numbers k such that k = floor(sqrt(k)*ceiling(sqrt(k))).

  • A050292: a(2n) = 2n - a(n), a(2n+1) = 2n + 1 - a(n) (for n >= 0).

  • A050407: a(n) = n*(n^2 - 6*n + 11)/6.

  • A050409: Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n} k^2.

  • A050410: Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n-1} k^2.

  • A050442: Octahedral torus number: a(n) = n^2 + 2*(Sum_{k=1..n-1} k^2) - 2*(floor((n+1)/2)^2 + 2*(Sum_{k=1..floor((n+1)/2)-1} k^2)) + (1 - (-1)^n)/2.

  • A050476: a(n) = C(n)*(6*n + 1) where C(n) = Catalan numbers (A000108).

  • A050477: a(n) = C(n)*(7*n + 1) where C(n) = Catalan numbers (A000108).

  • A050478: a(n) = C(n)*(8*n+1) where C(n) = Catalan numbers (A000108).

  • A050479: a(n) = C(n)*(9*n + 1) where C(n) = Catalan numbers (A000108).

  • A050487: Geometric Connell sequence: start with 1; then next two numbers == 2 mod 3; next four == 3 mod 3; next eight == 1 mod 3; etc.

  • A050488: a(n) = 3*(2^n-1) - 2*n.

  • A050489: a(n) = C(n)*(10*n + 1) where C(n) = Catalan numbers (A000108).

  • A050492: Thickened cube numbers: a(n) = n*(n^2 + (n-1)^2) + (n-1)*2*n*(n-1).

  • A050506: Nearest integer to log(Fibonacci(n)).

  • A050508: Golden rectangle numbers: n * A007067(n).

  • A050509: House numbers (version 2): a(n) = (n+1)^3 + (n+1)*Sum_{i=0..n} i.

  • A050514: Cards left over after dealing evenly to n people.

  • A050518: An arithmetic progression of at least 6 terms having the same value of phi starts at these numbers.

  • A050533: Thickened pyramidal numbers: a(n) = 2*(n+1)*n + Sum_{i=1..n} (4*i*(i-1) + 1).

  • A050534: Tritriangular numbers: a(n) = binomial(binomial(n,2),2) = n*(n+1)*(n-1)*(n-2)/8.

  • A050536: Iterated triangular numbers with seed 8.

  • A050542: Iterated triangular numbers with seed 5.

  • A050548: Iterated triangular numbers with seed 7.

  • A050621: Smallest n-digit number divisible by 2^n.

  • A050624: Let b(n) = A050623(n) = smallest n-digit number divisible by 3^n; sequence gives b(n)/3^n.

  • A050679: Positions of 2’s in A048288.

  • A050683: Number of nonzero palindromes of length n.

  • A050731: Decimal expansion of 11^n contains no pair of consecutive equal digits (probably finite).

  • A050763: Numbers k such that the decimal expansion of k^k contains no pair of consecutive equal digits (probably finite).

  • A050909: Iterated triangular numbers with seed 9.

  • A050914: a(n) = n*3^n + 1.

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

  • A050916: a(n) = n*5^n + 1.

  • A050917: a(n) = n*6^n + 1.

  • A050919: a(n) = n*7^n + 1.

  • A050923: a(n) = 2^(n!).

  • A050924: a(n) = (a(n-1)+1)^(a(n-1)), a(0) = 0.

  • A050982: 5-idempotent numbers.

  • A050988: 6-idempotent numbers.

  • A050989: 7-idempotent numbers.