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

A226953
Leap year numbers: numbers n such that tau(phi(n)) = phi(tau(n))^2, where tau(n) is the number of divisors of n and phi(n) the Euler totient function.
1
1, 2, 9, 14, 15, 18, 20, 22, 46, 94, 118, 166, 214, 231, 248, 286, 308, 310, 334, 344, 350, 351, 358, 366, 372, 392, 399, 405, 406, 430, 454, 483, 490, 494, 516, 518, 522, 526, 532, 536, 568, 595, 598, 632, 638, 644, 654, 663, 666
OFFSET
1,2
COMMENTS
Paraphrasing Doug Iannucci, n is called a "leap year number" if tau(phi(n)) = phi(tau(n))^2 (366 is a leap year number, hence the sequence name). The beast number is a leap year number. The only prime leap year number is 2.
LINKS
EXAMPLE
phi(666)=216, tau(216)=16, tau(666)=12, phi(12)=4, 4^2=16, therefore 666 is in the sequence.
MATHEMATICA
Select[Range[1000], DivisorSigma[0, EulerPhi[#]] == EulerPhi[DivisorSigma[0, #]]^2 &]
CROSSREFS
Cf. A137815 (Doug Iannucci's "year numbers").
Sequence in context: A220249 A071343 A043401 * A274133 A288483 A353308
KEYWORD
easy,nonn
AUTHOR
STATUS
approved