OFFSET
0,2
LINKS
A. S. Fraenkel, Recent results and questions in combinatorial game complexities, Theoretical Computer Science, vol. 249, no. 2 (2000), 265-288.
A. S. Fraenkel, Arrays, numeration systems and Frankenstein games, Theoret. Comput. Sci. 282 (2002), 271-284; preprint.
FORMULA
For n >= 0, A_0^n is the least nonnegative integer not in {A_j^n: 0 <= i < n, j >= 0, A_1^n = 2A_0^n + n, A_j^n = 3A_{j-1}^n - A_{j-2}^n (j >= 2).
a(n,k) = F(2k)*n + F(2k+1)*A026351(n). - Charlie Neder, Feb 07 2019
EXAMPLE
Top left corner of array:
1, 3, 8, 21, 55, ...
2, 6, 16, 42, 110, ...
4, 11, 29, 76, 199, ...
5, 14, 37, 97, 254, ...
MATHEMATICA
t[n_, 1] := Floor[(n - 1) GoldenRatio] + 1; t[n_, j_] := Floor[ GoldenRatio^2 t[n, j - 1]] + 1; Table[ t[n - m + 1, m], {n, 11}, {m, n}] // Flatten (* Birkas Gyorgy, Apr 15 2011; modified by Robert G. Wilson v, Apr 15 2011 *)
CROSSREFS
KEYWORD
AUTHOR
EXTENSIONS
More terms from Naohiro Nomoto, Jun 07 2001
STATUS
approved