147756

Appears in sequences

• Triangle read by rows. T(n, k) = Sum_{i=0..n} Stirling2(n, i)*Product_{j=1..k} (i - j + 1) for 0 <= k <= n.at n=39A059098
• Increasing partial quotients in the continued fraction expansion of the prime constant (A051006).at n=14A102878
• For k > a(n), the maximum number of steps that the Euclidean algorithm requires for computing (k,i), with i < k, is greater than n.at n=18A188224
• Number of (n+1) X (6+1) 0..1 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=14A253433
• Number of (6+1) X (n+1) 0..1 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=14A253440
• Expansion of Product_{k>=2} (1 + x^Fibonacci(k))^Fibonacci(k).at n=42A291650