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!)
A094548 Smallest m > n, coprime to n and having as many prime factors as n, with and without repetitions; a(1)=1. 1
1, 3, 5, 9, 7, 35, 11, 27, 25, 21, 13, 175, 17, 15, 22, 81, 19, 175, 23, 63, 22, 35, 29, 875, 49, 33, 125, 45, 31, 1001, 37, 243, 34, 35, 38, 875, 41, 39, 46, 189, 43, 715, 47, 45, 52, 51, 53, 4375, 121, 63, 55, 63, 59, 875, 57, 135, 58, 65, 61, 7007, 67, 65, 68 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

A094549(n) <= a(m).

LINKS

Table of n, a(n) for n=1..63.

CROSSREFS

Sequence in context: A029642 A221967 A079428 * A112661 A230725 A254689

Adjacent sequences:  A094545 A094546 A094547 * A094549 A094550 A094551

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 7 05:14 EST 2019. Contains 329839 sequences. (Running on oeis4.)