|
|
A219434
|
|
a(n) is the maximum number m such that A219365(m) is not divisible by n.
|
|
0
|
|
|
1966081, 12767708, 7756710936577, 166762837500004, 12767708, 27471403862610413838, 31057143398401, 340744843326260, 166762837500004, 22895635022104088254, 7756710936577, 766556623996809099695470878, 27471403862610413838, 166762837500004, 62114286796801
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
The second article by Myerson provides a Maple algorithm to compute a(n) when omega(n)=1. When omega(n) > 1, the maximum of a(p_i^n_i), with n = Product(p_i^n_i), is used.
Bachman and Kessler (2004) provide a table of a(n) for n < 100 being prime or a power of prime.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|