The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129138 a(n) = number of positive divisors of n that are <= phi(n), where phi(n) = A000010(n). 2
 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 4, 1, 2, 3, 4, 1, 4, 1, 4, 3, 2, 1, 6, 2, 2, 3, 4, 1, 5, 1, 5, 3, 2, 3, 7, 1, 2, 3, 6, 1, 5, 1, 4, 5, 2, 1, 8, 2, 4, 3, 4, 1, 6, 3, 6, 3, 2, 1, 9, 1, 2, 5, 6, 3, 5, 1, 4, 3, 6, 1, 10, 1, 2, 5, 4, 3, 5, 1, 8, 4, 2, 1, 9, 3, 2, 3, 6, 1, 9, 3, 4, 3, 2, 3, 10, 1, 4, 5, 7, 1, 5, 1, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 EXAMPLE phi(16) = 8. So a(16) is the number of divisors of 16 which are <= 8. There are 4 such divisors: 1, 2, 4, 8; so a(16) = 4. MAPLE with(numtheory): a:=proc(n) local div, ct, j: div:=divisors(n): ct:=0: for j from 1 to tau(n) do if div[j]<=phi(n) then ct:=ct+1 else ct:=ct: fi od: ct; end: seq(a(n), n=1..135); # Emeric Deutsch, Mar 31 2007 MATHEMATICA Table[Length[Select[Divisors[n], # <= EulerPhi[n] &]], {n, 104}] (* Jayanta Basu, May 23 2013 *) PROG (PARI) a(n)=my(p=eulerphi(n)); #select(k->k<=p, divisors(n)) \\ Charles R Greathouse IV, Mar 05 2013 CROSSREFS Cf. A129139, A126131, A074919. Sequence in context: A001055 A320266 A277692 * A112970 A112971 A299201 Adjacent sequences:  A129135 A129136 A129137 * A129139 A129140 A129141 KEYWORD nonn AUTHOR Leroy Quet, Mar 30 2007 EXTENSIONS More terms from Emeric Deutsch, Mar 31 2007 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.

Last modified February 21 20:04 EST 2020. Contains 332110 sequences. (Running on oeis4.)