47208

Appears in sequences

• Numbers k such that k^2 divides 2*Fibonacci(k).at n=11A130163
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k cycles that are not up-down. A cycle (b(1), b(2), ...) is said to be up-down if, when written with its smallest element in the first position, it satisfies b(1)<b(2)>b(3)<... .at n=20A186361
• Let a(0)=1. For n > 0, a(n) is the least integer greater than a(n-1) such that the polynomial 1/a(0) + x^1/a(1) +...+ x^n/a(n) has exactly n distinct real roots.at n=4A220476
• T(n, k) = Sum_{p in P(n, k)} card(p), where P(n, k) is the set of set partitions of {1,2,...,n} where the largest block has size k and card(p) is the number of blocks of p. Triangle T(n, k) for 0 <= k <= n, read by rows.at n=48A339030