The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A330752 Number of values of k, 1 <= k <= n, with A328478(k) = A328478(n), where A328478(n) gives the remainder when all maximal primorial divisors of n (from the largest to smallest) have been divided out. 2
 1, 2, 1, 3, 1, 4, 1, 5, 1, 2, 1, 6, 1, 2, 1, 7, 1, 2, 1, 3, 1, 2, 1, 8, 1, 2, 1, 3, 1, 9, 1, 10, 1, 2, 1, 11, 1, 2, 1, 4, 1, 4, 1, 3, 1, 2, 1, 12, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 13, 1, 2, 1, 14, 1, 4, 1, 3, 1, 2, 1, 15, 1, 2, 1, 3, 1, 4, 1, 5, 1, 2, 1, 6, 1, 2, 1, 5, 1, 3, 1, 3, 1, 2, 1, 16, 1, 2, 1, 3, 1, 4, 1, 5, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Ordinal transform of A328478. LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 PROG (PARI) up_to = 65537; ordinal_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), pt); for(i=1, length(invec), if(mapisdefined(om, invec[i]), pt = mapget(om, invec[i]), pt = 0); outvec[i] = (1+pt); mapput(om, invec[i], (1+pt))); outvec; }; A111701(n) = forprime(p=2, , if(n%p, return(n), n /= p)); A328478(n) = { my(u=A111701(n)); if(u==n, return(n), return(A328478(u))); }; v330752 = ordinal_transform(vector(up_to, n, A328478(n))); A330752(n) = v330752[n]; CROSSREFS Cf. A111701, A328478, A330751. Sequence in context: A085343 A049077 A180184 * A222266 A077609 A077610 Adjacent sequences:  A330749 A330750 A330751 * A330753 A330754 A330755 KEYWORD nonn AUTHOR Antti Karttunen, Dec 30 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 5 20:11 EDT 2021. Contains 346488 sequences. (Running on oeis4.)