OFFSET
3,1
COMMENTS
For n>=3, round(q^prime(n)) == 1 (mod 2*prime(n)). Proof in Shevelev link. In particular, all terms are even.
LINKS
S. Litsyn and V. Shevelev, Irrational Factors Satisfying the Little Fermat Theorem, International Journal of Number Theory, vol.1, no.4 (2005), 499-512.
V. Shevelev, A property of n-bonacci constant, Seqfan (Mar 23 2014)
Eric Weisstein's World of Mathematics, Tribonacci Constant
EXAMPLE
For n=3, q^5 = 21.049..., so a(3) = (21 - 1)/5 = 4.
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Shevelev and Peter J. C. Moses, Mar 20 2014
STATUS
approved