154038

Appears in sequences

• Number of distinct solutions of sum{i=1..3}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1.at n=22A180805
• Number T(n,k) of colored compositions of n using all colors of a k-set such that all parts have different color patterns and the patterns for parts i have i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=48A327245