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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094549 Smallest m > n, coprime to n and having as many prime factors as n; a(1)=1. 2

%I

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

%T 625,26,33,28,45,31,343,37,243,34,35,38,625,41,39,46,81,43,125,47,45,

%U 52,49,53,3125,51,63,55,63,59,625,57,81,58,65,61,2401,67,65,68,729,69

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

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

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

%C Prime factors counted with multiplicity. - _Harvey P. Dale_, Mar 27 2013

%H Harvey P. Dale, <a href="/A094549/b094549.txt">Table of n, a(n) for n = 1..1000</a>

%t scp[n_]:=Module[{m=n+1,po=PrimeOmega[n]},While[!CoprimeQ[n,m]||po!= PrimeOmega[ m], m++];m]; Join[{1},Array[scp,70,2]] (* _Harvey P. Dale_, Mar 27 2013 *)

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, May 10 2004

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 28 22:35 EST 2020. Contains 331328 sequences. (Running on oeis4.)