A239544 (Round(c^prime(n)) - 1)/prime(n), where c is the tetranacci constant (A086088).

14, 124, 390, 4118, 13690, 156122, 6351030, 22074820, 948652694, 11818395344, 41868809842, 528803858638, 24052859078262, 1108257471317098, 3982717894786008, 185987895674303758, 2422894681885464596, 8755616404517667662, 414985190213435939298

Offset: 4

Author

Vladimir Shevelev and Peter J. C. Moses, Mar 21 2014

Keywords

• nonn

Comments

For n>=4, round(c^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, Tetranacci Constant

Crossrefs

Cf. A007619, A007663, A238693, A238697, A238698, A238700, A086088, A239502.