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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A366297 Lexicographically earliest infinite sequence such that a(i) = a(j) => A359589(i) = A359589(j) for all i, j >= 1, where A359589 is Dirichlet inverse of function f(n) = (-1 + gcd(A003415(n), A276086(n))). 3
 1, 2, 2, 2, 2, 3, 2, 4, 5, 2, 2, 2, 2, 4, 6, 2, 2, 2, 2, 4, 7, 2, 2, 2, 7, 8, 4, 2, 2, 2, 2, 2, 9, 2, 5, 10, 2, 11, 6, 2, 2, 2, 2, 4, 4, 12, 2, 13, 9, 8, 7, 14, 2, 15, 6, 2, 6, 2, 2, 2, 2, 4, 4, 16, 17, 2, 2, 4, 6, 2, 2, 18, 2, 4, 3, 3, 17, 2, 2, 2, 18, 2, 2, 19, 6, 8, 6, 20, 2, 21, 6, 4, 6, 22, 5, 2, 2, 14, 8, 20, 2, 14, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Restricted growth sequence transform of A359589. For all i, j: A305800(i) = A305800(j) => a(i) = a(j) => A359595(i) = A359595(j). LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 PROG (PARI) up_to = 65537; rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om, invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om, invec[i], i); outvec[i] = u; u++ )); outvec; }; DirInverseCorrect(v) = { my(u=vector(#v)); u[1] = (1/v[1]); for(n=2, #v, u[n] = (-u[1]*sumdiv(n, d, if(d

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.

Last modified April 17 00:23 EDT 2024. Contains 371756 sequences. (Running on oeis4.)