167972
domain: N
Appears in sequences
- Composite Fibonacci sequence: each term is the composite with index equal to the sum of the previous two terms.at n=17A107390
- a(n) = number of subsets S of {1,2,...,n} having more than 2 elements such that (sum of least three elements of S) = max(S).at n=24A357287
- Irregular triangle read by rows: T(n,k) is the number of free polyaboloes (or polytans) with n cells of which 2*k share a hypotenuse in pairs (making up k squares), 0 <= k <= n/2.at n=53A391191
- Triangle read by rows: T(n,k) is the number of free polyaboloes (or polytans) with n cells (counted as in A390996) of which k are square cells consisting of two triangles sharing a hypotenuse, 0 <= k <= n.at n=49A391192