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!)
 A341596 Number of strictly inferior squarefree divisors of n. 28
 0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 4, 1, 2, 2, 2, 2, 3, 1, 2, 2, 3, 1, 4, 1, 2, 3, 2, 1, 4, 1, 3, 2, 2, 1, 4, 2, 3, 2, 2, 1, 5, 1, 2, 3, 2, 2, 4, 1, 2, 2, 4, 1, 4, 1, 2, 3, 2, 2, 4, 1, 3, 2, 2, 1, 5, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS We define a divisor d|n to be strictly inferior if d < n/d. Strictly inferior divisors are counted by A056924 and listed by A341674. LINKS EXAMPLE The strictly inferior squarefree divisors of selected n: n = 1  2  6  12  30  60  120  210  240  420  630  1050  1260     --------------------------------------------------------     {} 1  1  1   1   1   1    1    1    1    1    1     1           2  2   2   2   2    2    2    2    2    2     2              3   3   3   3    3    3    3    3    3     3                  5   5   5    5    5    5    5    5     5                      6   6    6    6    6    6    6     6                          10   7    10   7    7    7     7                               10   15   10   10   10    10                               14        14   14   14    14                                         15   15   15    15                                              21   21    21                                                   30    30                                                         35 MATHEMATICA Table[Length[Select[Divisors[n], SquareFreeQ[#]&&#

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 May 9 04:59 EDT 2021. Contains 343687 sequences. (Running on oeis4.)