61463

Properties

Appears in sequences

• Triangle T(n,k) read by rows given by [2,1,2,1,2,1,2,1,2,1,2,1,...] DELTA [1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938 .at n=37A133367
• Super-Catalan triangle (read by rows) = triangular array associated with little Schroeder numbers (read by rows): T(0,0)=1, T(p,q) = T(p,q-1) if 0 < p = q, T(p,q) = T(p,q-1) + T(p-1,q) + T(p-1,q-1) if -1 < p < q and T(p,q) = 0 otherwise.at n=52A144944
• Riordan array (s(x),x*S(x)) where s(x) is the g.f. of the little Schroeder numbers A001003, and S(x) is the g.f. of the large Schroeder numbers A006318.at n=47A186826
• There appear to be at least n primes in the range (x-2*sqrt(x), x] for all x >= a(n).at n=35A189027
• Expansion of g.f.: (1-5*x+2*x^2+(2*x-1)*sqrt(x^2-6*x+1))/(4*x).at n=9A238112
• Least prime p such that p*10^n-1, p*10^n-3, p*10^n-7 and p*10^n-9 are all prime.at n=13A243411
• a(n) is the smallest prime p such that Sum_{primes q <= p} Kronecker(A003658(n),q) > 0, or 0 if no such prime exists.at n=3A306499
• a(n) is the smallest prime p such that Sum_{primes q <= p} Kronecker(n,q) > 0, or 0 if no such prime exists.at n=11A326615
• a(n) is the smallest prime p such that Sum_{primes q <= p} Kronecker(n,q) > 0, or 0 if no such prime exists.at n=47A326615
• a(n) is the least prime p such that 5^n * p + 6 is the square of a prime.at n=5A358422
• a(n) is the least prime p such that p + 4*k*(k+1) is prime for 0 <= k <= n-1 but not for k=n.at n=8A371024
• Prime numbersat n=6181