login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

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
1, 3, 5, 9, 7, 25, 11, 27, 10, 21, 13, 125, 17, 15, 22, 81, 19, 125, 23, 27, 22, 25, 29, 625, 26, 33, 28, 45, 31, 343, 37, 243, 34, 35, 38, 625, 41, 39, 46, 81, 43, 125, 47, 45, 52, 49, 53, 3125, 51, 63, 55, 63, 59, 625, 57, 81, 58, 65, 61, 2401, 67, 65, 68, 729, 69 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

a(n) <= A094548(m).

Prime factors counted with multiplicity. - Harvey P. Dale, Mar 27 2013

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

MATHEMATICA

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 *)

CROSSREFS

Sequence in context: A003961 A100463 A166722 * A029642 A221967 A079428

Adjacent sequences:  A094546 A094547 A094548 * A094550 A094551 A094552

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, May 10 2004

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 14:38 EST 2019. Contains 329865 sequences. (Running on oeis4.)