46933

Properties

Appears in sequences

• Let p(k) denote k-th prime; consider solutions (p(n),p(m)) of Diophantine equation p(p(n)+1)-6.p(p(m))=1 (*), where p(p(n)) belongs to A060213 and p(p(m))=(p(p(n))+1)/6; sequence gives values of p(n).at n=5A065505
• Primes of the form 256 k + 85.at n=34A127593
• Primes p such that 2*p^2 + 3 and 2*p^2 + 5 are also primes.at n=33A247197
• Lexicographically largest increasing sequence of primes for which the continued square root map (see A257574) produces Pi.at n=31A257582
• Number of symmetrical self-avoiding walks with maximum length on an n X n board which start in the upper left corner and go right on the first step.at n=8A331001
• Number of one-sided pseudo-polytans with n cells.at n=4A354403
• Triangle read by rows: numerators of the almost-Riordan array ( (3 - 3*x)/(2*x^2 - 6*x + 3) | 3/(2*x^2 - 6*x + 3), (1 - 3*x - sqrt(5*x^2 - 6*x + 1))/(2*x) ).at n=50A389749
• Prime numbersat n=4848