cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A239565 #22 Feb 16 2025 08:33:21
%S A239565 6702,23594,301738,14576792,53653610,2738173594,38254296398,
%T A239565 143514673148,2032676550562,109797468019174,6007838407290514,
%U A239565 22863415355711030,1267938526864061370,18523200405015238420,70884650213591098558,3989789924439684599434
%N A239565 (Round(c^prime(n)) - 1)/prime(n), where c is the hexanacci constant (A118427).
%C A239565 For n>=7, round(c^prime(n)) == 1 (mod 2*prime(n)). Proof in Shevelev link. In particular, all terms are even.
%H A239565 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 A239565 V. Shevelev, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2014-March/012750.html">A property of n-bonacci constant</a>, Seqfan (Mar 23 2014)
%H A239565 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HexanacciConstant.html">Hexanacci Constant</a>
%Y A239565 Cf. A007619, A007663, A238693, A238697, A238698, A238700, A118427, A239502, A239544, A239564.
%K A239565 nonn
%O A239565 7,1
%A A239565 _Vladimir Shevelev_ and _Peter J. C. Moses_, Mar 21 2014