|
%I #20 Jan 02 2023 12:30:50
%S 6702,23594,301738,14576792,53653610,2738173594,38254296398,
%T 143514673148,2032676550562,109797468019174,6007838407290514,
%U 22863415355711030,1267938526864061370,18523200405015238420,70884650213591098558,3989789924439684599434
%N (Round(c^prime(n)) - 1)/prime(n), where c is the hexanacci constant (A118427).
%C For n>=7, round(c^prime(n)) == 1 (mod 2*prime(n)). Proof in Shevelev link. In particular, all terms are even.
%H S. Litsyn and V. Shevelev, <a href="http://dx.doi.org/10.1142/S1793042105000339">Irrational Factors Satisfying the Little Fermat Theorem</a>, International Journal of Number Theory, vol.1, no.4 (2005), 499-512.
%H V. Shevelev, <a href="http://list.seqfan.eu/oldermail/seqfan/2014-March/012750.html">A property of n-bonacci constant</a>, Seqfan (Mar 23 2014)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HexanacciConstant.html">Hexanacci Constant</a>
%Y Cf. A007619, A007663, A238693, A238697, A238698, A238700, A118427, A239502, A239544, A239564.
%K nonn
%O 7,1
%A _Vladimir Shevelev_ and _Peter J. C. Moses_, Mar 21 2014
|
