A239565 (Round(c^prime(n)) - 1)/prime(n), where c is the hexanacci constant (A118427).

6702, 23594, 301738, 14576792, 53653610, 2738173594, 38254296398, 143514673148, 2032676550562, 109797468019174, 6007838407290514, 22863415355711030, 1267938526864061370, 18523200405015238420, 70884650213591098558, 3989789924439684599434

Offset: 7

Author

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

Keywords

• nonn

Comments

For n>=7, 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, Hexanacci Constant

Crossrefs

Cf. A007619, A007663, A238693, A238697, A238698, A238700, A118427, A239502, A239544, A239564.