35975domain: NAppears in sequencesa(n) = (4^n mod 3^n) mod 2^n.at n=17A064536Least k such that gcd(prime(k+1)-1, prime(k)-1) = 2n.at n=29A067605n^3 + n-th cubefree number.at n=32A180499Table read by downward diagonals: T(n,k) = number of skeleta of (3+1)-free posets with n clone sets and k tangles.at n=32A221494