login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A220895
Number of closed lambda-terms of size n with at most 1 free de Bruijn index.
3
1, 3, 13, 76, 542, 4493, 42131, 439031, 5020105, 62382279, 835980065, 12004984120, 183754242626, 2984264710781, 51220227153987, 925859588215096, 17571969962025822, 349210371834021295, 7249185099929421649, 156847124089924073770, 3530125495029323284404
OFFSET
0,2
LINKS
Katarzyna Grygiel and Pierre Lescanne, Counting and generating lambda-terms, arXiv preprint arXiv:1210.2610 [cs.LO], 2012.
FORMULA
Grygiel and Lescanne give a recurrence.
MATHEMATICA
T[0, m_] := m; T[n_, m_] := T[n, m] = T[n-1, m+1] + Sum[T[i, m] T[n-i-1, m], {i, 0, n-1}];
a[n_] := T[n, 1];
Table[a[n], {n, 0, 14}] (* Jean-François Alcover, May 23 2017 *)
CROSSREFS
Sequence in context: A047730 A162435 A059040 * A352308 A336421 A189239
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 31 2012
EXTENSIONS
More terms from Alois P. Heinz, May 23 2017
STATUS
approved