23159

Properties

Appears in sequences

• a(n) = prime(Fibonacci(n)).at n=17A030427
• Cube root of A030683.at n=25A030684
• Primes which set a new record for length of Pratt certificate.at n=11A037231
• Primes p such that 4*p and 6*p are each the sum of two consecutive primes.at n=36A164133
• a(n) = prime(Fibonacci(phi(n))), where prime = A000040, Fibonacci = A000045 and phi = A000010.at n=18A181058
• a(n) = prime(Fibonacci(phi(n))), where prime = A000040, Fibonacci = A000045 and phi = A000010.at n=26A181058
• a(n) = prime(Fibonacci(phi(n))), where prime = A000040, Fibonacci = A000045 and phi = A000010.at n=37A181058
• Number of nX3 arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor, without 2-loops or left turns.at n=7A221887
• Primes p such that floor(log(p)) + p^2 is prime.at n=24A225626
• Primes of the form 7*k^2 + 7*k + 17.at n=44A256374
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 526", based on the 5-celled von Neumann neighborhood.at n=42A272744
• Primes p such that A272207(p) = p.at n=23A276030
• a(n) is the smallest prime p > a(n-1) such that p - a(n-1) is an (n-1)-almost prime; a(1) = 2.at n=12A276591
• Primes p such that p^3 - 1 has 8 divisors.at n=22A341659
• Expansion of e.g.f. exp(-x) / (1 + log(1 - 2*x)/2).at n=6A368451
• a(n) = numerator(Sum_{k=1..n} d(k+1)/d(k)), where d is the number of divisors function.at n=45A386925
• Prime numbersat n=2584