441061

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the smallest number such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=18A049961
• a(n) = (1/n!)*Sum_{k=0..n} Stirling1(n,k)*A062208(k).at n=4A136245
• Number of scalene triangles, distinct up to congruence, on a centered hexagonal grid of size n.at n=25A241236
• Number of length 6+5 0..n arrays with some three disjoint pairs in each consecutive six terms having the same sum.at n=9A248495
• Array read by antidiagonals: A(n,k) is the number of binary matrices with k distinct columns and any number of nonzero rows with n ones in every column and columns in decreasing lexicographic order.at n=31A331277