|
|
A239502
|
|
(Round(q^prime(n)) - 1)/prime(n), where q is the tribonacci constant (A058265).
|
|
5
|
|
|
4, 10, 74, 212, 1856, 5618, 53114, 1630932, 5161442, 167427844, 1729192432, 5577731626, 58401766802, 2005139696964, 69737304018266, 228184540445268, 8043367476888770, 86866463049858250, 285815985033409648, 10225367934387562098, 111384745483589787826
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
For n>=3, round(q^prime(n)) == 1 (mod 2*prime(n)). Proof in Shevelev link. In particular, all terms are even.
|
|
LINKS
|
|
|
EXAMPLE
|
For n=3, q^5 = 21.049..., so a(3) = (21 - 1)/5 = 4.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|