255231
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of ternary words of length n containing k 012's (n >= 0, 0 <= k <= floor(n/3)).at n=42A119851
- Numbers k such that k and k+1 have different (ordered) prime signatures and d_3(k) = d_3(k+1), where d_3 is A007425.at n=22A333057
- a(n) is the maximum number of strong sub-tournaments in an n-tournament.at n=18A386875