|
| |
|
|
A072751
|
|
Greatest of the most frequent prime factors of squarefree numbers <= n; a(1)=1.
|
|
4
|
|
|
|
1, 2, 3, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
a(n)=2 for n>14.
|
|
|
LINKS
|
|
|
|
MATHEMATICA
|
max = 200; primeFactors = FactorInteger[#][[All, 1]]& /@ Select[Range[max], SquareFreeQ]; a[n_] := Sort[ Tally[ Take[ primeFactors, n] // Flatten], Which[#1[[2]] > #2[[2]], True, #1[[2]] == #2[[2]], #1[[1]] > #2[[1]], True, False]& ][[1, 1]]; Table[a[n], {n, 1, primeFactors // Length}] (* Jean-François Alcover, Oct 14 2013 *)
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,nice
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
