|
|
A239544
|
|
(Round(c^prime(n)) - 1)/prime(n), where c is the tetranacci constant (A086088).
|
|
4
|
|
|
14, 124, 390, 4118, 13690, 156122, 6351030, 22074820, 948652694, 11818395344, 41868809842, 528803858638, 24052859078262, 1108257471317098, 3982717894786008, 185987895674303758, 2422894681885464596, 8755616404517667662, 414985190213435939298
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
4,1
|
|
COMMENTS
|
For n>=4, round(c^prime(n)) == 1 (mod 2*prime(n)). Proof in Shevelev link. In particular, all terms are even.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|