|
|
A090851
|
|
Smallest positive k such that phi(2n*k+1) < phi(2n*k), where phi is Euler's totient function.
|
|
1
|
|
|
157, 131, 41449509748313314446079881572662251904099551759079570289, 103, 87200213, 23228416536806454739917249069243610966391359542839893417, 28651, 59, 16202086544304724831441296633918338274264333181606642583
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Note that a(3) = (5 * 7 * 11 * 13 * 17 * 19 * 23 * ... * 149 - 1) / 6. When 2n is the product of distinct small primes, a(n) is very large; e.g. Martin shows that a(15) is a 1116-digit number. The large values of a(n) were computed quickly using a backtracking algorithm.
|
|
LINKS
|
|
|
CROSSREFS
|
Cf. A090849 (least k such that phi(1+k*2^n) <= phi(k*2^n)).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Replaced arXiv URL by non-cached version - R. J. Mathar, Oct 30 2009
|
|
STATUS
|
approved
|
|
|
|