148329
domain: N
Appears in sequences
- a(n) = n*a(n-1) + (n-1)*a(n-2), a(0) = 1, a(1) = 1.at n=8A000255
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1).at n=44A010027
- Irregular triangle read by rows: T(n,k) (n>=1, 0 <= k <= floor(n/2)) = number of permutations of 1..n with exactly floor(n/2) - k runs of consecutive pairs up.at n=28A010029
- 8th differences of factorial numbers.at n=1A023045
- Triangular array formed from successive differences of factorial numbers, then with factorials removed.at n=53A060475
- Triangle T[n,m]: T[n,-1] = 0; T[0,0] = 0; T[n,0] = n*n!; T[n,m] = T[n,m-1] - T[n-1,m-1].at n=43A061312
- Euler's difference table: triangle read by rows, formed by starting with factorial numbers (A000142) and repeatedly taking differences. T(n,n) = n!, T(n,k) = T(n,k+1) - T(n-1,k).at n=46A068106
- Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n).at n=43A076731
- Expansion of g.f. 1/(1-x-x^2-x^4-x^5).at n=21A079976
- Triangle T(n, k), read by row, related to Euler's difference table A068106 (divide column k of A068106 by k!).at n=46A086764
- Bisection of A000255.at n=4A100444
- First differences of the rows in the triangle of A116853, starting with 0.at n=36A116854
- First differences of the rows in the triangle of A116853, starting with 0.at n=46A116854
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k small descents (n >= 1; 0 <= k <= n-1). A small descent in a permutation (x_1,x_2,...,x_n) is a position i such that x_i - x_(i+1) = 1.at n=36A123513
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k maximal strings of increasing consecutive integers (0<=k<=floor(n/2)).at n=25A136123
- Triangle read by rows, n-th row = n terms of A000255: (1, 3, 11, 53, 309, ...); right border = A000166 starting (1, 2, 9, 44, 265, ...).at n=27A159610
- Triangle read by rows, n-th row = n terms of A000255: (1, 3, 11, 53, 309, ...); right border = A000166 starting (1, 2, 9, 44, 265, ...).at n=28A159610
- Triangle read by rows, n-th row = n terms of A000255: (1, 3, 11, 53, 309, ...); right border = A000166 starting (1, 2, 9, 44, 265, ...).at n=29A159610
- Triangle read by rows, n-th row = n terms of A000255: (1, 3, 11, 53, 309, ...); right border = A000166 starting (1, 2, 9, 44, 265, ...).at n=30A159610
- Triangle read by rows, n-th row = n terms of A000255: (1, 3, 11, 53, 309, ...); right border = A000166 starting (1, 2, 9, 44, 265, ...).at n=31A159610