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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A239564 (Round(c^prime(n)) - 1)/prime(n), where c is the pentanacci constant (A103814). 3
 154, 504, 5758, 19912, 245714, 11251030, 40679232, 1967728552, 26525975822, 97753187576, 1335948880418, 68398141417510, 3547322151373882, 13260715720748120, 697034813138756392, 9825603574709578482, 36935066391752894480, 1970457739485406707872 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,1 COMMENTS For n>=5, 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, Pntanacci Constant CROSSREFS Cf. A007619, A007663, A238693, A238697, A238698, A238700, A103814, A239502, A239544. Sequence in context: A320708 A261377 A256024 * A250626 A235107 A235100 Adjacent sequences: A239561 A239562 A239563 * A239565 A239566 A239567 KEYWORD nonn AUTHOR Vladimir Shevelev and Peter J. C. Moses, Mar 21 2014 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.

Last modified December 1 21:09 EST 2022. Contains 358484 sequences. (Running on oeis4.)