299040
domain: N
Appears in sequences
- a(n) = Fibonacci(n) AND Fibonacci(n+1).at n=29A051122
- Triangular array read by rows. T(n,k) is the number of idempotent binary relations on [n] having no proper power primitive (A360718) with exactly k irreflexive points.at n=24A370208
- Triangle read by rows: T(n, k) = (Sum_{i=0..n-k} (-1)^i * binomial(n-k, i) * (n+2-i)!) * binomial(n, k) / ((k+1) * (k+2)) for 0 <= k <= n.at n=32A373050