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!)
 A241556 Number of prime anti-divisors m of n. 2
 0, 0, 1, 1, 2, 0, 3, 2, 1, 2, 3, 1, 3, 1, 1, 2, 5, 2, 3, 2, 1, 2, 3, 1, 4, 2, 3, 4, 3, 0, 3, 4, 3, 2, 3, 0, 3, 4, 3, 1, 2, 2, 5, 2, 3, 4, 5, 2, 3, 2, 1, 3, 4, 0, 3, 2, 3, 4, 5, 3, 4, 3, 2, 2, 3, 2, 5, 2, 1, 2, 5, 4, 5, 2, 1, 2, 5, 2, 3, 4, 3, 3, 4, 1, 4, 2, 3, 4, 3, 0, 3, 4, 5, 4, 3, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS The maximum value of a(n) is 9 for 1 <= n <= 10000. There are 167 instances of a(n) = 0 for 1 <= n <= 10000 (See A241557). LINKS Michael De Vlieger, Table of n, a(n) for n = 1..10000 EXAMPLE a(10) = 2, since 10 has 3 anti-divisors {3, 4, 7}; only {3, 7} are prime. a(9223) = 9; these are {2, 3, 5, 7, 11, 13, 17, 31, 43}. MATHEMATICA primeAntiDivisors[n_] := Select[Cases[Range[2, n - 1], _?(Abs[Mod[n, #] - #/2] < 1 &)], PrimeQ]; a241556[n_Integer] := Map[Length[primeAntiDivisors[#]] &, Range[n]]; a241556[120] CROSSREFS Cf. A066272, A192281, A242965, A242966, A241557. Sequence in context: A342176 A325195 A026728 * A242029 A090722 A221879 Adjacent sequences:  A241553 A241554 A241555 * A241557 A241558 A241559 KEYWORD nonn AUTHOR Michael De Vlieger, Aug 08 2014 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 April 10 22:21 EDT 2021. Contains 342856 sequences. (Running on oeis4.)