161876

Appears in sequences

• Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=3, k=0 and l=1.at n=9A176606
• Number T(n,k) of sequences in {1,...,n}^n with longest increasing subsequence of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=32A245667
• Number of sequences in {1,...,n}^n with longest increasing subsequence of length four.at n=3A268871