login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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
Sequence in context: A358869 A031846 A289516 * A234242 A252602 A224689
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)