2, 2, 6, 12, 30, 54, 126, 240, 504
2, -2, -2, 0, -2, 2, -2, 0, 0
Maple has developed a sophisticated strategy to ensure that the experience of its users is one of hopping from bug to bug.
It is based on two pillars: To change basic definitions (which are in fact fixed since Euclid) from time to time, and, secondly, to rely on the fact that their long-time users can't always adapt that quickly.
A nice example with the current Maple version (2023) is:
restart; with(numtheory):
A027375 := n -> local d; add(mobius(d)*2^(n/d), d = divisors(n)): seq(A027375(n), n = 1..9);
2, 2, 6, 12, 30, 54, 126, 240, 504
restart; with(NumberTheory):
A027375 := n -> local d; add(Moebius(d)*2^(n/d), d = divisors(n)): seq(A027375(n), n = 1..9);
2, -2, -2, 0, -2, 2, -2, 0, 0
If you have nothing better to do, you can waste your time trying to find the bug.
Maple has developed a sophisticated strategy to ensure that the experience of its users is one of hopping from bug to bug.
It is based on two pillars: To change basic definitions (which are in fact fixed since Euclid) from time to time, and, secondly, to rely on the fact that their long-time users can't always adapt that quickly.
A nice example with the current Maple version (2023) is:
restart; with(numtheory):
A027375 := n -> local d; add(mobius(d)*2^(n/d), d = divisors(n)): seq(A027375(n), n = 1..9);
2, 2, 6, 12, 30, 54, 126, 240, 504
restart; with(NumberTheory):
A027375 := n -> local d; add(Moebius(d)*2^(n/d), d = divisors(n)): seq(A027375(n), n = 1..9);
2, -2, -2, 0, -2, 2, -2, 0, 0
If you have nothing better to do, you can waste your time trying to find the bug.
| Sysop: | Keyop |
|---|---|
| Location: | Huddersfield, West Yorkshire, UK |
| Users: | 715 |
| Nodes: | 16 (0 / 16) |
| Uptime: | 162:59:18 |
| Calls: | 12,095 |
| Calls today: | 3 |
| Files: | 15,000 |
| Messages: | 6,517,783 |