|
|
A239564
|
|
a(n) = (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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
_Vladimir Shevelev_ and _Peter J. C. Moses_, Mar 21 2014
|
|
STATUS
|
approved
|
|
|
|