**T(n,k) is the number of arrays of n+2 elements from {0,1,...,k} with no two consecutive ascents.**

*8, 26, 16, 60, 75, 32, 115, 225, 216, 64, 196, 530, 840, 622, 128, 308, 1071, 2425*

*4 seqfan posts*

*Wed Nov 23 06:45:46 CET 2011* [seqfan] Re: Oops!^2 final try, guess the formula http://oeis.org/A200785

*Wed Nov 23 01:42:42 CET 2011* [seqfan] Re: Oops!^2 final try, guess the formula http://oeis.org/A200785

*Wed Nov 23 00:01:10 CET 2011* [seqfan] Re: Oops!^2 final try, guess the formula http://oeis.org/A200785

*Tue Nov 22 20:13:17 CET 2011* [seqfan] Oops!^2 final try, guess the formula http://oeis.org/A200785

Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword

Links to OEIS content are included according to
The OEIS End-User License Agreement
.