|
%I #24 Feb 28 2023 09:23:10
%S 154,504,5758,19912,245714,11251030,40679232,1967728552,26525975822,
%T 97753187576,1335948880418,68398141417510,3547322151373882,
%U 13260715720748120,697034813138756392,9825603574709578482,36935066391752894480,1970457739485406707872
%N a(n) = (round(c^prime(n)) - 1)/prime(n), where c is the pentanacci constant (A103814).
%C For n>=5, round(c^prime(n)) == 1 (mod 2*prime(n)). Proof in Shevelev link. In particular, all terms are even.
%H S. Litsyn and Vladimir 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 Vladimir 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/PentanacciConstant.html">Pentanacci Constant</a>
%Y Cf. A000040, A007619, A007663, A238693, A238697, A238698, A238700, A103814, A239502, A239544.
%K nonn
%O 5,1
%A _Vladimir Shevelev_ and _Peter J. C. Moses_, Mar 21 2014
|
