|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|