A355129 a(n) is the number of integer sequences b(0..n) of length n+1, with 0 <= b(k) <= k! and monotonic b(k) <= b(k+1).
2, 3, 7, 40, 856, 91821, 60080136, 279276911843, 10503211888973754, 3585680755683196123365, 12323227994417456429490342865, 468378989392773003347310901356953089, 214565221409985003242070442557341938941878313, 1282499669290042152350268651085002913530161723080398635
Offset: 0
Keywords
Examples
For a(0) we get two possible sequences: {0}, {1}. For a(1) we get three possible sequences: {0, 0}, {0, 1}, {1, 1}. For a(2) = 7 we get: {0, 0, 0}, {0, 0, 1}, {0, 0, 2}, {0, 1, 1}, {0, 1, 2}, {1, 1, 1}, {1, 1, 2}.
Crossrefs
Programs
-
PARI
a(n) = binomial((n-1)! + n-1, n-1) + binomial((n-1)! + n-2, n-1) + sum(r = 1, n-2, sum(k = 0, r-1 ,binomial((n-1)! - r! - k+n - 2, n-1)*binomial(r-1,k)*a(r)*(-1)^(k+1)))
Formula
a(n) = binomial((n-1)! + n-1, n-1) + binomial((n-1)! + n-2, n-1) + Sum_{r = 1..n-2} Sum_{k = 0..r-1} binomial((n-1)! - r! - k+n - 2, n-1)*binomial(r-1,k)*a(r)*(-1)^(k+1).
Comments