OFFSET
1,3
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1275
FORMULA
Form an array t(m,n) (n >= 1, 1 <= m <= n) by: t(1,n) = Fibonacci(n+1) for all n; t(m+1,n) = (n-m)*floor( (t(m,n) - 1)/(n-m) ) for 1 <= m <= n-1.
MATHEMATICA
t[n_, k_]:= t[n, k]= If[k==1, Fibonacci[n+1], (n-k+1)*Floor[(t[n, k-1] -1)/(n-k+1)]];
Table[t[n, n-k+1], {n, 15}, {k, n}]//TableForm (* G. C. Greubel, Apr 07 2023 *)
PROG
(Magma)
function t(n, k)
if k eq 1 then return Fibonacci(n+1);
else return (n-k+1)*Floor((t(n, k-1) -1)/(n-k+1));
end if;
end function;
[t(n, n-k+1): k in [1..n], n in [1..15]]; // G. C. Greubel, Apr 07 2023
(SageMath)
def t(n, k):
if (k==1): return fibonacci(n+1)
else: return (n-k+1)*((t(n, k-1) -1)//(n-k+1))
flatten([[t(n, n-k+1) for k in range(1, n+1)] for n in range(1, 16)]) # G. C. Greubel, Apr 07 2023
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Joshua Zucker, May 20 2006
STATUS
approved