

A239565


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


2



6702, 23594, 301738, 14576792, 53653610, 2738173594, 38254296398, 143514673148, 2032676550562, 109797468019174, 6007838407290514, 22863415355711030, 1267938526864061370, 18523200405015238420, 70884650213591098558, 3989789924439684599434
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

7,1


COMMENTS

For n>=7, round(c^prime(n)) == 1 (mod 2*prime(n)). Proof in Shevelev link. In particular, all terms are even.


LINKS

Table of n, a(n) for n=7..22.
S. Litsyn and V. Shevelev, Irrational Factors Satisfying the Little Fermat Theorem, International Journal of Number Theory, vol.1, no.4 (2005), 499512.
V. Shevelev, A property of nbonacci 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.
Sequence in context: A206008 A031846 A289516 * A234242 A252602 A224689
Adjacent sequences: A239562 A239563 A239564 * A239566 A239567 A239568


KEYWORD

nonn


AUTHOR

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


STATUS

approved



