40073

Appears in sequences

• Numbers n such that prime(n) mod n <= 10.at n=52A022465
• Numbers k such that prime(k) == 5 (mod k).at n=6A023147
• Least k such that k-th prime > n * k.at n=11A038606
• Values of pi(x) where x exceeds n * pi(x).at n=11A038624
• Index j of prime p(j) such that floor(p(j)/j) = n is first satisfied.at n=11A062742
• Numbers k such that phi(prime(k) + 1) == 0 (mod k).at n=18A067732
• Duplicate of A038606.at n=12A090974
• Number of solutions to x*frac[p(x)/x]<=Log[n] or A004648(n)<=Log[n].at n=27A099641
• Number of nX4 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.at n=4A183478
• Number of nX5 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.at n=3A183479
• T(n,k)=Number of nXk 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.at n=31A183483
• T(n,k)=Number of nXk 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.at n=32A183483
• Least integer k > 0 such that prime(k) - k*n is prime.at n=11A247895
• G.f. satisfies A(x) = Sum_{n>=0} x^n * (1+x)^(2*n^2) / A(x)^(n*(n+1)).at n=11A380687