25775

Appears in sequences

• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k hills of the form ud (a hill is either a ud or a Udd starting at the x-axis).at n=21A108433
• Number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have no hills of the form ud (a hill is either a ud or a Udd starting at the x-axis).at n=6A108434
• Numbers whose digits are prime and which retain this property when multiplied by some 1-digit prime (i.e., one of 2, 3, 5 or 7).at n=19A227922
• Products of 3 evil primes (A027699) p,q,r, such that numbers p*q, p*r, q*r, and p*q*r are odious (A000069).at n=29A230353
• Integers of the form 8k + 7 that can be written as a sum of four distinct squares of the form m, m + 1, m + 3, m + 5, where m == 2 (mod 4).at n=19A243580
• Numbers k such that 461*2^k+1 is prime.at n=7A323200