This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A211701 #11 Nov 11 2017 17:27:25 %S A211701 1,2,1,3,3,1,4,4,3,1,5,6,5,3,1,6,7,7,5,3,1,7,9,8,8,5,3,1,8,10,11,9,8, %T A211701 5,3,1,9,12,12,12,10,8,5,3,1,10,13,14,13,13,10,8,5,3,1,11,15,16,16,14, %U A211701 14,10,8,5,3,1,12,16,18,18,17,15,14,10,8,5,3,1,13,18,19,20,19 %N A211701 Rectangular array by antidiagonals, n >= 1, k >= 1: R(n,k) = n + [n/2] + ... + [n/k], where [ ]=floor. %C A211701 R(n,k) is the number of ordered pairs (x,y) of integers x,y satisfying 1 <= x <= k, 1 <= y <= k, and x*y <= n. %C A211701 Limiting row: A000618=(1,3,5,8,10,14,16,20,...). %C A211701 Row 1: A000027 %C A211701 Row 2: A032766 %C A211701 Row 3: A106252 %C A211701 Row 4: A211703 %C A211701 Row 5: A211704 %C A211701 R(n,n) = A000618(n) %C A211701 ... %C A211701 For n > =1, row n is a homogeneous linear recurrence sequence of order A005728(n), and it exemplifies a certain class, C, of recurrences which are palindromic (in the sense given below). The class depends on sequences s having n-th term [(n^k)/j], where k and j are arbitrary fixed positive integers and [ ] = floor. The characteristic polynomial of s is (x^j-1)(x-1)^k, which is a palindromic polynomial (sometimes called a reciprocal polynomial). The class C consists of sequences u given by the form %C A211701 ... %C A211701 u(n) = c(1)*[r(1)*n^k(1)] + ... + c(m)*[r(m)*n^k(m)], %C A211701 ... %C A211701 where c(i) are integers and r(i) are rational numbers. Assume that r(i) is in lowest terms, and let j(i) be its denominator. Then the characteristic polynomial of u is the least common multiple of all the irreducible (over the integers) factors of all the polynomials (x^j(i)-1)(x-1)^k(i). As all such factors are palindromic (indeed, they are all cyclotomic polynomials), the characteristic polynomial of u is also palindromic. In other words, if the generating function of u is written as p(x)/q(x), then q(x) is a palindromic polynomial. %C A211701 Thus, if q(x) = q(h)x^h + ... + q(1)x + q(0), %C A211701 then (q(h), q(h-1), ..., q(1), q(0)) is palindromic, and consequently, the recurrence coefficients for u, after excluding q(0); i.e., (- q(h-1), ... - q(1)), are palindromic. For example, row 3 of A211701 has the following recurrence: u(n) = u(n-2) + u(n-3) - u(n-5), for which q(x) = x^5 - x^3 - x^2 + 1, with recurrence coefficients (0,1,1,0,-1). %C A211701 Recurrence coefficients (palindromic after excluding the last term) are shown here: %C A211701 for row 1: (2, -1) %C A211701 for row 2: (1 ,1, -1) %C A211701 for row 3: (0, 1, 1, 0, -1) %C A211701 for row 4: (0, 0, 1, 1, 0, 0, -1) %C A211701 for row 5: (-1, -1, 0, 1, 2, 2, 1, 0, -1, -1, -1) %C A211701 for row 6: (0, -1, 0, 0, 1, 1, 1, 1, 0, 0, -1, 0, -1) %C A211701 for row 7: (-1, -2, -2, -2, -1, 0, 2, 3, 4, 4, 3, 2, %C A211701 0, -1, -2, -2, -2, -1, -1) %C A211701 for row 13: (-2,-4,-7,-12,-18,-27,-37,-50,-64,-80,-95, %C A211701 -111,-123,-133,-137,-136,-126,-110,-84,-52, %C A211701 -12,32,80,127,173,213,246,269,281,281,269, %C A211701 246,213,173,127,80,32,-12,-52,-84,-110, %C A211701 -126,-136,-137,-133,-123,-111,-95,-80,-64, %C A211701 -50,-37,-27,-18,-12,-7,-4,-2,-1) %e A211701 Northwest corner: %e A211701 1 2 3 4 5 6 7 8 9 10 %e A211701 1 3 4 6 7 9 10 12 13 15 %e A211701 1 3 5 7 8 11 12 14 16 18 %e A211701 1 3 5 8 9 12 13 16 18 19 %t A211701 f[n_, m_] := Sum[Floor[n/k], {k, 1, m}] %t A211701 TableForm[Table[f[n, m], {m, 1, 20}, {n, 1, 16}]] %t A211701 Flatten[Table[f[n + 1 - m, m], {n, 1, 14}, {m, 1, n}]] %Y A211701 Cf. A211702, A211703, A211704, A211705. %K A211701 nonn,tabl %O A211701 1,2 %A A211701 _Clark Kimberling_, Apr 19 2012