25214
domain: N
Appears in sequences
- a(n) = prime(a(n-2)) + abs(prime(n) - a(n-2)) with a(1)=a(2)=1.at n=12A086913
- Equal count of primes congruent to 1 mod 4 and 3 mod 4 associated with primes in A007351 (the zero beginning the sequence indicates the prime 2).at n=21A092198
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 3 (0<=k<=floor(n/3)). Also number of ordered trees with n edges that have k vertices of outdegree 3.at n=26A114506
- Number of Dyck paths of semilength n having no ascents of length 3.at n=11A114507
- Numbers k such that 22*3^k + 1 is prime.at n=38A120491
- Numbers k such that 10^k - 801 is prime.at n=28A271618