48096

Appears in sequences

• a(n) = n! (1/C(n,0) + 1/C(n,1) + ... + 1/C(n,[ n/2 ])).at n=8A024419
• Square table, read by antidiagonals, where the g.f. for row n+1 is generated by: x*R_{n+1}(x) = (1+n*x - 1/R_n(x))/(n+1) with R_0(x) = Sum_{n>=0} n!*x^n.at n=61A111528
• Row 4 of table A111528.at n=6A111531
• Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^p) = p*(column p+4 of T), or [T^p](m,0) = p*T(p+m,p+4) for all m>=1 and p>=-4.at n=21A111553
• Lower triangular array called S1hat(1) related to partition number array A107106.at n=46A144351
• a(n) = 1458*n - 18.at n=32A157508
• Number of (n+1) X 7 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.at n=8A207048
• n-th derivative of x^(2*x) at x=1.at n=9A265945
• Triangle read by rows, 0 <= k < n, n >= 2: T(n,k) is the eventual period of the modified Fibonacci sequence x(j) (or 0 if x(j) never enters a cycle) defined as follows: x(0) = 0, x(1) = 1, and for j > 1 x(j) is obtained from x(j-1) + x(j-2) by deleting all occurrences of the digit k in base n.at n=71A306773