28661

Properties

Appears in sequences

• Next prime after n-th Fibonacci number.at n=23A014208
• Primes that remain prime through 3 iterations of function f(x) = 3x + 8.at n=23A023279
• Primes which remain prime after one and after two applications of the rotate-and-add operation of A086002.at n=22A086003
• Primes by index in A001945.at n=55A104499
• Number of n X n binary matrices with every 1 vertically or horizontally adjacent to some 0.at n=3A133515
• a(n) = Fibonacci(n) + 4.at n=23A157727
• Primes such that applying "reverse and add" twice produces two more primes.at n=17A174402
• Primes that can be expressed as the sum of a Fibonacci number and the square of a Fibonacci number.at n=24A178991
• Primes that are the sum of squares of three positive Fibonacci numbers.at n=34A191375
• Hilltop maps: number of nX4 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 nX4 array.at n=3A218350
• T(n,k) = Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 n X k array.at n=24A218354
• Primes of form n^2 + 28561.at n=1A256841
• Number of 3Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=19A301792
• Number of nX4 0..1 arrays with every element unequal to 0, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=21A304137
• Boustrophedon primes: write the numbers 0, 1, 2, 3, ... in a triangle on a square grid in the boustrophedon manner, ending a row when a prime is reached; sequence lists primes that appear in the zeroth column.at n=7A330339
• Union of 2, A282178, and A330339.at n=31A330554
• Prime numbersat n=3122