22907

Properties

Appears in sequences

• The $620 prime list.at n=10A018188
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A000201 (lower Wythoff sequence).at n=24A024593
• Decimal part of cube root of a(n) starts with 4: first term of runs.at n=27A034130
• Primes which remain prime after one and after two applications of the rotate-and-add operation of A086002.at n=16A086003
• Primes which remain prime after one and after two and after three applications of the rotate-and-add operation of A086002.at n=4A086004
• Primes congruent to 32 mod 61.at n=36A142830
• Primes of the form 2*k^2 + 9.at n=41A201476
• Primes of the form p^2 + 2q^2 with p and q odd primes.at n=32A201613
• G.f. satisfies: A(x) = (1 + x*(3-x)*A(x)) * (1 + x^2*A(x)).at n=8A216454
• Near-Wilson primes (p = prime(n) satisfying (p-1)! == -1-A250406(n)*p (mod p^2)) with A250406(n) < 10.at n=18A250407
• Primes p such that p = q^2 + 2*r^2 where q and r are also primes.at n=33A260553
• Number of (n+1)X(4+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=5A262468
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=41A262472
• Number of (6+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=3A262476
• Primes p congruent to 1 modulo 13 such that x^13 = 2 has a solution modulo p.at n=13A275773
• Primes p such that 4*p+3, 6*p+5 and 8*p+7 are all primes.at n=32A329551
• Prime numbersat n=2557