(In reply to
A few ideas by Brian Smith)
I like the 3rd one very much, it’s original and well defined !
I will include it, inter alia, in the official solution.
3, 7, 11, 19, 31, 51, 83, ... not applicable to n<3t(n) = t(n-1) + t(n-2) + 1
3, 7, 11, 12, 2, -40, -169, ... wrong formula, good idea
If f(n) is the nth Fibonacci number then t(n) = (n+2)^2 - f(n)
3, 7, 11, 19, 23, 31, 43, ... bravo
Primes congruent to 3 mod 4
Go get more!
Edited on October 19, 2019, 12:50 am