I often have to generate Fibonacci prime numbers so I created this simple online utility that does it for me. It lets you calculate however many Fibonacci primes or their indexes as you need, starting from any position. It works in the browser and is powered by alien technology from the future.

## Fibonacci Primes Generator Options

Primes or Indexes
Start, Count and Separator
Primes or Indexes Base

## Fibonacci Primes Generator Examples (click to try!)

First 12 Fibonacci Primes
In this example, we calculate the first twelve Fibonacci prime numbers.
```2
3
5
13
89
233
1597
28657
514229
433494437
2971215073
99194853094755497```
Print Fibonacci Primes
Starting position.
Generate this many Fibonacci prime numbers or indexes.
Separate Fibonacci primes or indexes with this character.
Decimal Base
First 30 Fibonacci Indexes
This example generates the first 30 indexes "n" of Fibonacci prime numbers "Fn" and separates them by the comma character.
`3, 4, 5, 7, 11, 13, 17, 23, 29, 43, 47, 83, 131, 137, 359, 431, 433, 449, 509, 569, 571, 2971, 4723, 5387, 9311, 9677, 14431, 25561, 30757, 35999`
Print Fibonacci Indexes
Starting position.
Generate this many Fibonacci prime numbers or indexes.
Separate Fibonacci primes or indexes with this character.
Decimal Base
Fibonacci Primes in Binary Base
In this example, we generate six Fibonacci primes in the binary base, starting from the 5th Fibonacci prime (F5).
```1011001
11101001
11000111101
110111111110001
1111101100010110101
11001110101101001100110100101```
Print Fibonacci Primes
Starting position.
Generate this many Fibonacci prime numbers or indexes.
Separate Fibonacci primes or indexes with this character.
Binary Base

## How Does This Fibonacci Primes Generator Work?

This Fibonacci prime number generator works entirely in your browser and is written in JavaScript. As there are not that many Fibonacci primes (only 50 are known) and they grow very rapidly (the 50th has more than half a million digits), it uses a pre-computed sequence of the first 30 Fibonacci prime numbers and their indexes. This sequence is kept in a JavaScript library called `fibonacci-primes.js` and it's an array called `fiboPrimes` of anonymous objects with keys `prime` and `index`. To select `count` (number of primes or indexes to generate; specified in options) objects from the `fiboPrimes` array, it uses the `slice(start, start + count)` method. After extracting the required number of objects, it either selects the `prime` or `index` property, depending on if Fibonacci primes or Fibonacci indexes option was selected and converts them to the given `base` (specified in options). Finally, the returned values are `join()`ed together through the `separator` symbol (also specified in options).

### Created by Browserling

This fibonacci primes generator was created by me and my team at Browserling. Behind the scenes, it's actually powered by our programmer tools that are used by millions of people every month. Browserling itself is an online cross-browser testing service powered by alien technology. Check it out!

Secret message: If you love my tools, then I love you, too! Use coupon code TOOLLING to get a discount at my company.