cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A341675 Number of superior odd divisors of n.

This page as a plain text file.
%I A341675 #11 Dec 13 2021 16:15:16
%S A341675 1,0,1,0,1,1,1,0,2,1,1,0,1,1,2,0,1,1,1,1,2,1,1,0,2,1,2,1,1,1,1,0,2,1,
%T A341675 2,1,1,1,2,0,1,2,1,1,3,1,1,0,2,1,2,1,1,2,2,0,2,1,1,1,1,1,3,0,2,2,1,1,
%U A341675 2,1,1,1,1,1,3,1,2,2,1,0,3,1,1,1,2,1,2,1,1,2,2,1,2,1,2,0,1,1,3,1,1,2,1,1,4
%N A341675 Number of superior odd divisors of n.
%C A341675 We define a divisor d|n to be superior if d >= n/d. Superior divisors are counted by A038548 and listed by A161908.
%H A341675 Antti Karttunen, <a href="/A341675/b341675.txt">Table of n, a(n) for n = 1..20000</a>
%e A341675 The superior odd divisors of selected n:
%e A341675 n = 1  9  45  105  225  315  945  1575  1890  2835  3465  8190
%e A341675    -----------------------------------------------------------
%e A341675     1  9  45  105  225  315  945  1575  945   2835  3465  4095
%e A341675        3  15  35   75   105  315  525   315   945   1155  1365
%e A341675           9   21   45   63   189  315   189   567   693   819
%e A341675               15   25   45   135  225   135   405   495   585
%e A341675                    15   35   105  175   105   315   385   455
%e A341675                         21   63   105   63    189   315   315
%e A341675                              45   75    45    135   231   273
%e A341675                              35   63          105   165   195
%e A341675                                   45          81    105   117
%e A341675                                               63    99    105
%e A341675                                                     77    91
%e A341675                                                     63
%t A341675 Table[Length[Select[Divisors[n],OddQ[#]&&#>=n/#&]],{n,100}]
%o A341675 (PARI) A341675(n) = sumdiv(n,d,(d%2)*(d>=n/d)); \\ _Antti Karttunen_, Dec 13 2021
%Y A341675 The inferior version is A069288.
%Y A341675 Positions of 0's (except a(1)) are A116882.
%Y A341675 The version for prime instead of odd divisors is A341591.
%Y A341675 The version for squarefree instead of odd divisors is A341592.
%Y A341675 The version for prime-power instead of odd divisors is A341593.
%Y A341675 The strictly superior case is A341594.
%Y A341675 A001221 counts prime divisors, with sum A001414.
%Y A341675 A005117 lists squarefree numbers.
%Y A341675 A033676 selects the greatest inferior divisor.
%Y A341675 A033677 selects the smallest superior divisor.
%Y A341675 A038548 counts superior (or inferior) divisors.
%Y A341675 A056924 counts strictly superior (or strictly inferior) divisors.
%Y A341675 A161908 lists superior divisors.
%Y A341675 A207375 lists central divisors.
%Y A341675 - Inferior: A063962, A066839, A161906, A217581, A333749, A333750.
%Y A341675 - Superior: A051283, A059172, A063538, A063539, A070038, A116882, A341676.
%Y A341675 - Strictly Inferior: A060775, A070039, A333805, A333806, A341596, A341674.
%Y A341675 - Strictly Superior: A048098, A064052 A140271, A238535, A341595, A341642, A341643, A341644, A341645, A341646, A341673.
%Y A341675 Cf. A000005, A000203, A001222, A001248, A006530, A020639.
%K A341675 nonn
%O A341675 1,9
%A A341675 _Gus Wiseman_, Feb 23 2021
%E A341675 Data section extended up to 105 terms by _Antti Karttunen_, Dec 13 2021