login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Smallest m > n, coprime to n and having as many prime factors as n, with and without repetitions; a(1)=1.
1

%I #4 Mar 30 2012 18:50:44

%S 1,3,5,9,7,35,11,27,25,21,13,175,17,15,22,81,19,175,23,63,22,35,29,

%T 875,49,33,125,45,31,1001,37,243,34,35,38,875,41,39,46,189,43,715,47,

%U 45,52,51,53,4375,121,63,55,63,59,875,57,135,58,65,61,7007,67,65,68

%N Smallest m > n, coprime to n and having as many prime factors as n, with and without repetitions; a(1)=1.

%C GCD(a(n),n)=1, A001221(a(n))=A001221(n), A001222(a(n))=A001222(n) and (A001221(m)<>A001221(n) or A001222(m)<>A001222(n)) for m: n<m<a(n);

%C A094549(n) <= a(m).

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, May 10 2004