First Bernoulli polynomial evaluated at x=n! and multiplied by 2.
a(0) = 1, for n >= 1: a(n) = numbers m for which there is one iteration {floor(r/k)} for k = n, n-1, n-2, ... 1 with property r mod k = k-1 starting at r = m.
For n = 5: a(5) = 239;
floor(239/5) = 47, 239 mod 5 = 4;
floor( 47/4) = 11, 47 mod 4 = 3;
floor( 11/3) = 3, 11 mod 3 = 2;
floor( 3/2) = 1, 3 mod 2 = 1;
floor( 1/1) = 1, 1 mod 1 = 0. (End)
With offset 1, is the eigensequence of a triangle with the natural numbers (1, 2, 3, ...) as the right border, (1, 1, 2, 3, 4, ...) as the left border; and the rest zeros. -
Gary W. Adamson, Aug 01 2016
