OFFSET
0,1
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.
MATHEMATICA
max = 53; Clear[t]; t[0, 0] = 1; t[n_, 1] := t[n, 1] = 2*t[n, 0] + n + 1; t[n_, 0] := t[n, 0] = For[u = Table[t[m, k], {m, 0, n-1}, {k, 0, max-m}] // Flatten // Union; k = 1, k <= n*(n+1)/2 + 1, k++, If[u[[k]] != k, Return[k]]]; t[n_, k_] := t[n, k] = 3*t[n, k-1] - t[n, k-2]; a[n_] := t[n, 2]; Table[a[n], {n, 0, max}] (* Jean-François Alcover, Jul 16 2015 *)
CROSSREFS
KEYWORD
nonn,nice,easy
AUTHOR
EXTENSIONS
More terms from Naohiro Nomoto, Jun 08 2001
STATUS
approved