|
|
A305762
|
|
a(0) = 24, a(n) = 2^(max(0, min(3, p - 1))) * 3^(max(0, min(1, q - 1))) where n = 2^p * 3^q * 5^r * ... .
|
|
2
|
|
|
24, 1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 2, 1, 1, 1, 8, 1, 3, 1, 2, 1, 1, 1, 4, 1, 1, 3, 2, 1, 1, 1, 8, 1, 1, 1, 6, 1, 1, 1, 4, 1, 1, 1, 2, 3, 1, 1, 8, 1, 1, 1, 2, 1, 3, 1, 4, 1, 1, 1, 2, 1, 1, 3, 8, 1, 1, 1, 2, 1, 1, 1, 12, 1, 1, 1, 2, 1, 1, 1, 8, 3, 1, 1, 2, 1, 1, 1, 4, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
a(n+144) = a(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 77/36. - Amiram Eldar, Oct 15 2022
|
|
MATHEMATICA
|
a[n_] := GCD[24, n/GCD[6, n]]; Array[a, 100, 0] (* Amiram Eldar, Oct 15 2022 *)
|
|
PROG
|
(Ruby)
require 'prime'
return 24 if n == 0
s = 1
s *= 3 if n % 9 == 0
n.prime_division.each{|i|
s *= 2 ** [3, (i[1] - 1)].min if i[0] == 2
}
s
end
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,mult
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|