3234846616domain: NAppears in sequencesSmallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 2<=i<=n.at n=8A071554a(n) = number of bits in the binary expansion of A046967(n).at n=9A135249Triangle read by rows: T(n,k) = (A002110(n) + A002110(k)) / A002110(k), 1 <= k <= n.at n=45A370135