282880
domain: N
Appears in sequences
- The smallest k such that the number of steps in the n Collatz sequences starting at k+i, i=0..n-1, is always prime.at n=31A174538
- a(n) = r1^n + r2^n + r3^n where r1, r2, r3 are the three roots of x^3 - 2*x - 2 = 0.at n=21A191697
- Number of unordered pairs of disjoint self-avoiding paths with nodes that cover all vertices of a convex n-gon; one node paths are not allowed.at n=12A308914
- Triangle read by rows: T(n,k) is the number of noncrossing path sets on n nodes with k paths and each path having at least two nodes, 0 <= k <= floor(n/2).at n=51A390908