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!)
 A341674 Irregular triangle read by rows giving the strictly inferior divisors of n. 35
 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 1, 3, 1, 2, 1, 1, 2, 3, 1, 1, 2, 4, 1, 3, 1, 2, 1, 1, 2, 3, 4, 1, 1, 2, 1, 3, 1, 2, 4, 1, 1, 2, 3, 5, 1, 1, 2, 4, 1, 3, 1, 2, 1, 5, 1, 2, 3, 4, 1, 1, 2, 1, 3, 1, 2, 4, 5, 1, 1, 2, 3, 6, 1, 1, 2, 4, 1, 3 (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. The number of strictly inferior divisors of n is A056924(n). LINKS EXAMPLE Triangle begins:      1: {}        16: 1,2        31: 1      2: 1         17: 1          32: 1,2,4      3: 1         18: 1,2,3      33: 1,3      4: 1         19: 1          34: 1,2      5: 1         20: 1,2,4      35: 1,5      6: 1,2       21: 1,3        36: 1,2,3,4      7: 1         22: 1,2        37: 1      8: 1,2       23: 1          38: 1,2      9: 1         24: 1,2,3,4    39: 1,3     10: 1,2       25: 1          40: 1,2,4,5     11: 1         26: 1,2        41: 1     12: 1,2,3     27: 1,3        42: 1,2,3,6     13: 1         28: 1,2,4      43: 1     14: 1,2       29: 1          44: 1,2,4     15: 1,3       30: 1,2,3,5    45: 1,3,5 MATHEMATICA Table[Select[Divisors[n], #

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 15 04:03 EDT 2021. Contains 343909 sequences. (Running on oeis4.)