138581

Properties

Appears in sequences

• Let p_(3,2)(m) be the m-th prime == 2(mod 3). Then a(n) is the smallest p_(3,2)(m) such that the interval(p_(3,2)(m)*n, p_(3,2)(m+1)*n) contains exactly one prime == 2 (mod 3).at n=31A210467
• Number of (n+6)X7 0..1 matrices with each 7X7 subblock idempotent.at n=5A224581
• Number of (n+6)X12 0..1 matrices with each 7X7 subblock idempotent.at n=0A224586
• T(n,k)=Number of (n+6)X(k+6) 0..1 matrices with each 7X7 subblock idempotent.at n=15A224588
• T(n,k)=Number of (n+6)X(k+6) 0..1 matrices with each 7X7 subblock idempotent.at n=20A224588
• Number of composites removed in each step in the Sieve of Eratosthenes for 10^8.at n=23A227797
• Prime numbersat n=12894