23148

Appears in sequences

• Number of mobiles (circular rooted trees) with n nodes and 4 leaves.at n=14A055342
• Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; the n-th Fibonacci number is in antidiagonal a(n).at n=41A057042
• Number of 4-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions.at n=21A187299
• Number of (n+1) X (6+1) 0..2 arrays colored with the upper median value of each 2 X 2 subblock.at n=7A235952
• Numbers n such that 2*n + prime(n) is a square.at n=42A256246
• G.f. A(x) satisfies: A'(x)/2 = Series_Reversion( x - x*A'(x) - A(x) ).at n=5A259611
• a(n) = 1 + 2 * (a(n-1) + a(n-4) + a(n-6)) + a(n-7) for n>3, with initial values 0 if n<0, and 1,3,8,18 for n=0..3.at n=12A317188
• a(1) = 1; a(n) = Sum_{d|n, d < n} phi(n/d) * d * a(d).at n=53A326824
• Triangle read by rows: T(n,k) = (n-k-1+H(k+1))*((k+1)!) for 0 <= k <= n where H(k+1) = Sum_{i=0..k} 1/(i+1) for k >= 0.at n=51A336746
• a(n) = Sum_{k=0..n} (k+1) * 3^k * binomial(2*n+2,n-k).at n=5A383832
• Array read by ascending antidiagonals: A(n, k) = Sum_{j=0..n} binomial(k, j)*|Stirling1(n, j)|.at n=57A387152
• a(n) = (n - 1)!*(2 + Harmonic(n - 1)) if n >= 1, and a(0) = 1.at n=8A387205