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”).

a(n) = m/n where m is the least number divisible by n such that phi(m) = phi(m+6n).
2

%I #8 Oct 02 2012 12:16:44

%S 24,24,24,24,36,24,24,24,24,36,24,24,24,24,36,24,24,24,24,36,24,24,24,

%T 24,36,24,24,24,24,36,24,24,24,24,60,24,24,24,24,36,24,24,24,24,36,24,

%U 24,24,24,36,24,24,24,24,36,24,24,24,24,36,24,24,24,24,36

%N a(n) = m/n where m is the least number divisible by n such that phi(m) = phi(m+6n).

%H Michel Marcus, <a href="/A217140/b217140.txt">Table of n, a(n) for n = 1..1000</a>

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

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

%e 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.

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

%K nonn

%O 1,1

%A _Michel Marcus_ and _Jonathan Sondow_, Oct 01 2012