76562domain: NAppears in sequencesa(n) = 8^n mod 3^n.at n=11A138955Triangle read by rows: T(n,k) = number of permutations of (1, 2, ..., n) with longest monotonic subsequence of length k (1<=k<=n).at n=51A366503