OFFSET
1,5
COMMENTS
row 4: A004187
For x>1, define c(x,0) = 1 and c(x,n) = ceiling(x*c(x,n-1)) for n>0. Row m of A214986 is the sequence c(r^m,n), where r = golden ratio = (1 + sqrt(5))/2. The name of the array corresponds to the power ceiling function f(x) = limit of c(x,n)/x^n as n increases without bound; f(x) generalizes the case for x = 3/2 as described under "Power Ceilings" at MathWorld. For a graph of f(x), see the Mathematica program at A083286.
The term "power ceiling sequence" extends to sequences generated by recurrences P(n) = ceiling(x*P(n-1)) + g(n), and "power ceiling functions" f(x) to the limit of P(n)/x^n in case x>1 and g(n)/x^n -> 0.
Suppose that h is a nonnegative integer and g(n) is a constant. If x is a positive integer power of the golden ratio r, then f(x), in many cases, lies in the field Q(sqrt(5)). Examples matching rows of A214986, using g(n) = 0, follow:
...
x ... P ........ f(x)
r^3 . A049652 .. (25 + 11*sqrt(5))/40 = 1.2399...
r^4 . A004187 .. (15 + 7*sqrt(5))/10 = 1.0219...
...
If k is odd, then f(r^k) = r^k((b(k) + c(k))/d(k)), where
LINKS
Clark Kimberling, Antidiagonals n = 1..35, flattened
Eric Weisstein's World of Mathematics, Power Ceilings
FORMULA
EXAMPLE
Northwest corner:
1...1....1.....1......1.......1
1...2....4.....7......12......20
1...3....8.....21.....55......144
1...5....22....94.....399.....1691
1...7....48....329....2255....15456
1...19...134...1487...16492...182900
MATHEMATICA
r = GoldenRatio;
s[x_, 0] := 1; s[x_, n_] := Ceiling[x*s[x, n - 1]];
t = TableForm[Table[s[r^m, n], {m, 0, 10}, {n, 0, 10}] ]
u = Flatten[Table[s[r^m, n - m], {n, 0, 10}, {m, 0, n}]]
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Oct 28 2012
STATUS
approved