|
Search: id:A087029
|
|
|
| A087029 |
|
Number of dismal divisors of n (unbounded version). |
|
+0
4
|
|
| 9, 8, 7, 6, 5, 4, 3, 2, 1, 18, 90, 16, 14, 12, 10, 8, 6, 4, 2, 16, 16, 72, 14, 12, 10, 8, 6, 4, 2, 14, 14, 14, 56, 12, 10, 8, 6, 4, 2, 12, 12, 12, 12, 42, 10, 8, 6, 4, 2, 10, 10, 10, 10, 10, 30, 8, 6, 4, 2, 8, 8, 8, 8, 8, 8, 20, 6, 4, 2, 6, 6, 6, 6, 6, 6, 6, 12, 4, 2, 4, 4, 4, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Number of d, 1 <= d <= infinity, such that there exists an e, 1 <= e <= infinity, with d*e = n, where * is dismal multiplication.
|
|
LINKS
|
D. Applegate, C program for dismal arithmetic and number theory
Index entries for sequences related to dismal arithmetic
|
|
EXAMPLE
|
The 18 divisors of 10 are 1, 2, ..., 9, 10, 20, 30, ..., 90, so a(10) = 18.
|
|
MAPLE
|
(Uses programs from A087062. This crude program is valid for n <= 99.) dd2 := proc(n) local t1, t2, i, j; t1 := []; for i from 1 to 99 do for j from i to 99 do if dmul(i, j) = n then t1 := [op(t1), i, j]; fi; od; od; t1 := convert(t1, set); t2 := sort(convert(t1, list)); nops(t2); end;
|
|
CROSSREFS
|
Cf. A087028, A087083.
Adjacent sequences: A087026 A087027 A087028 this_sequence A087030 A087031 A087032
Sequence in context: A138531 A030076 A083824 this_sequence A104348 A089186 A055120
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Marc LeBrun and njas, Oct 19 2003
|
|
EXTENSIONS
|
More terms from David Applegate (david(AT)research.att.com), Nov 07 2003
|
|
|
Search completed in 0.002 seconds
|
