|
Search: id:A060775
|
|
|
| A060775 |
|
Lower central (median) divisor of n. |
|
+0
6
|
|
| 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 3, 2, 1, 3, 1, 4, 3, 2, 1, 4, 1, 2, 3, 4, 1, 5, 1, 4, 3, 2, 5, 4, 1, 2, 3, 5, 1, 6, 1, 4, 5, 2, 1, 6, 1, 5, 3, 4, 1, 6, 5, 7, 3, 2, 1, 6, 1, 2, 7, 4, 5, 6, 1, 4, 3, 7, 1, 8, 1, 2, 5, 4, 7, 6, 1, 8, 3, 2, 1, 7, 5, 2, 3, 8, 1, 9, 7, 4, 3, 2, 5, 8, 1, 7, 9, 5, 1, 6, 1, 8, 7, 2
(list; graph; listen)
|
|
|
OFFSET
|
2,5
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=2,...,1000
|
|
EXAMPLE
|
n=252, D={1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 63, 84, 126, 252}, 18 divisors, the 9th is 14, so a(252)=14.
|
|
MATHEMATICA
|
Table[Part[Divisors[w], Floor[DivisorSigma[0, w]/2]], {w, 1, 256}]
|
|
PROGRAM
|
(PARI) { for (n=2, 1000, d=divisors(n); write("b060775.txt", n, " ", d[length(d)\2]); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 11 2009]
|
|
CROSSREFS
|
Cf. A033677, A000196, A000005, A000142, A027423, A055226, A060776, A060777.
Sequence in context: A056924 A045778 A033103 this_sequence A055399 A029426 A085342
Adjacent sequences: A060772 A060773 A060774 this_sequence A060776 A060777 A060778
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Apr 26 2001
|
|
|
Search completed in 0.002 seconds
|
