Hi to all dear SeqFan members.
A little discovery about prime numbers (starting with the Buenos Aires constant).
Over the past few days, I've been playing with the constant:
C ≈ 2.9200509773161347...
the famous one that "contains" all the prime numbers.
And starting from my formula for (p_{n+1}), I managed to construct an explicit formula to directly obtain (p_{n+2})... and even a general version for (p_{n+k}).
---
Formula for (p_{n+2})
Let's define:
A = C Pₙ − pₙ ⌊C Pₙ₋₁ − 1⌋
(where (Pₙ = pₙ#), the primordial)
Then:
pₙ₊₂ = ⌊ ⌊A⌋ · (A − ⌊A⌋ + 1) ⌋
---
Fully expanded formula
pₙ₊₂ = ⌊ ⌊C Pₙ − pₙ⌊C Pₙ₋₁ − 1⌋⌋ ·
( C Pₙ − pₙ⌊C Pₙ₋₁ − 1⌋ − ⌊C Pₙ − pₙ⌊C Pₙ₋₁ − 1⌋⌋ + 1 ) ⌋
---
Generalization to (p_{n+k})
We define recursively:
A₁ = C Pₙ − pₙ⌊C Pₙ₋₁ − 1⌋
Aₖ₊₁ = ⌊Aₖ⌋ · (Aₖ − ⌊Aₖ⌋ + 1)
Then:
pₙ₊ₖ = ⌊Aₖ⌋
What do you think? Could I submit it to the encyclopedia?
Davide