login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A327530 Number of divisors of n that are 1 or whose prime indices are relatively prime. 2
1, 2, 1, 3, 1, 3, 1, 4, 1, 3, 1, 5, 1, 3, 2, 5, 1, 4, 1, 5, 1, 3, 1, 7, 1, 3, 1, 5, 1, 6, 1, 6, 2, 3, 2, 7, 1, 3, 1, 7, 1, 5, 1, 5, 3, 3, 1, 9, 1, 4, 2, 5, 1, 5, 2, 7, 1, 3, 1, 10, 1, 3, 1, 7, 1, 6, 1, 5, 2, 6, 1, 10, 1, 3, 3, 5, 2, 5, 1, 9, 1, 3, 1, 9, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. Numbers whose prime indices are relatively prime are A289509. The maximum divisor of n that is 1 or whose prime indices are relatively prime is A327529(n).
LINKS
EXAMPLE
The divisors of 84 that are 1 or whose prime indices are relatively prime are {1, 2, 4, 6, 12, 14, 28, 42, 84}, so a(84) = 9.
MAPLE
N:= 100: # for a(1)..a(N)
g:= proc(n) uses numtheory; igcd(op(map(pi, factorset(n))))=1 end proc:
V:= Vector(N, 1):
for k in select(g, [$2..N]) do
R:=[seq(i, i=k..N, k)]:
V[R]:= map(`+`, V[R], 1);
od:
convert(V, list); # Robert Israel, Sep 19 2019
MATHEMATICA
Table[Length[Select[Divisors[n], #==1||GCD@@PrimePi/@First/@FactorInteger[#]==1&]], {n, 100}]
CROSSREFS
See link for additional cross-references.
Sequence in context: A306248 A361788 A327513 * A084360 A082460 A318573
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 17 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)