Taxicab Count
taxicab_countHow many positive integers through n have at least two writings as a sum of two positive cubes. Through 100 there are none, through 1729 there is 1, and through 4104 there are 2. n runs from 0 to 5000. Price: $0.001 USDC per successful call (x402, Solana). Same tool over HTTPS: POST https://scorptech.it.com/api/x402/v1/taxicab-count
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"n": "<n>"
},
"name": "taxicab_count"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |