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!)
A217140 a(n) = m/n where m is the least number divisible by n such that phi(m) = phi(m+6n). 2
24, 24, 24, 24, 36, 24, 24, 24, 24, 36, 24, 24, 24, 24, 36, 24, 24, 24, 24, 36, 24, 24, 24, 24, 36, 24, 24, 24, 24, 36, 24, 24, 24, 24, 60, 24, 24, 24, 24, 36, 24, 24, 24, 24, 36, 24, 24, 24, 24, 36, 24, 24, 24, 24, 36, 24, 24, 24, 24, 36, 24, 24, 24, 24, 36 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Michel Marcus, Table of n, a(n) for n = 1..1000

EXAMPLE

A179188(1)=24 is divisible by 1 and the quotient is 24, so a(1)=24.

A217139(1)=48 is divisible by 2 and the quotient is 24, so a(2)=24.

The first solution to phi(n)=phi(n+18) to be divisible by 3 is 72 and the quotient is 24, so a(3)=24.

CROSSREFS

Cf. A007015, A179188, A217139, A217141, A217068.

Sequence in context: A278656 A308419 A010863 * A235249 A115028 A099543

Adjacent sequences:  A217137 A217138 A217139 * A217141 A217142 A217143

KEYWORD

nonn

AUTHOR

Michel Marcus and Jonathan Sondow, Oct 01 2012

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 16 09:06 EST 2019. Contains 330020 sequences. (Running on oeis4.)