|
|
A359382
|
|
a(n) = number of k < t such that rad(k) = rad(t) and k does not divide t, where t = A360768(n) and rad(k) = A007947(k).
|
|
2
|
|
|
1, 1, 1, 2, 2, 4, 2, 1, 1, 1, 4, 2, 2, 4, 1, 1, 1, 1, 3, 1, 3, 2, 8, 1, 2, 1, 7, 2, 1, 2, 5, 2, 1, 1, 3, 3, 1, 6, 1, 1, 5, 5, 4, 5, 1, 1, 4, 8, 3, 3, 1, 2, 1, 4, 2, 3, 5, 10, 2, 1, 3, 3, 1, 1, 1, 6, 1, 3, 7, 1, 1, 7, 3, 14, 3, 6, 3, 2, 1, 1, 2, 7, 2, 1, 1, 2, 2, 8, 4, 6, 4, 8, 1, 1, 2, 1, 6, 9, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
This sequence contains nonzero values in A355432.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
---------------------------------
1 18 12 1
2 24 18 1
3 36 24 1
4 48 18, 36 2
5 50 20, 40 2
6 54 12, 24, 36, 48 4
|
|
MATHEMATICA
|
rad[x_] := rad[x] = Times @@ FactorInteger[x][[All, 1]];
s = Select[Range[671], Nor[SquareFreeQ[#], PrimePowerQ[#]] &];
t = Select[s, #1/#2 >= #3 & @@ {#1, Times @@ #2, #2[[2]]} & @@
{#, FactorInteger[#][[All, 1]]} &];
Map[Function[{n, k},
Count[TakeWhile[s, # < n &],
_?(And[rad[#] == k, ! Divisible[n, #]] &)]] @@ {#, rad[#]} &, t]
|
|
CROSSREFS
|
Cf. A007947, A010846, A013929, A020639, A024619, A027750, A126706, A162306, A243822, A272618, A355432, A359929, A360589, A360768.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|