Developer Tools
onlouis.de
Provides information about a custom software development agency and facilitates project inquiries.
ENDPOINT 1
https://onlouis.de/api/mcp
MCP server metadata
- Name
- onlouis-mcp
- Version
- 1.0.0
Known tools 3
get_company_infoGet information about OnLouis – a German custom software development agency specializing in web platforms, API integrations, and business process digitalization.
Inferred read-onlyget_servicesGet the list of services offered by OnLouis including custom web development, API integration, and legacy system modernization.
Inferred read-onlyCONNECT WITH APPROVAL
Client installation
Review this server and its permissions before adding it. Secret placeholders must be set locally.
Codex
~/.codex/config.toml
[mcp_servers.onlouis-mcp]
url = "https://onlouis.de/api/mcp"
enabled = true
Claude Code
.mcp.json
{
"mcpServers": {
"onlouis-mcp": {
"type": "http",
"url": "https://onlouis.de/api/mcp"
}
}
}
Claude Desktop
Settings → Connectors → Add custom connector
Name: onlouis-mcp
Remote MCP URL: https://onlouis.de/api/mcp
Add this remote URL as a custom connector in Claude Desktop. Availability depends on the user plan and workspace policy.
Cursor
.cursor/mcp.json
{
"mcpServers": {
"onlouis-mcp": {
"url": "https://onlouis.de/api/mcp"
}
}
}
Visual Studio Code
.vscode/mcp.json
Add to Visual Studio Code{
"servers": {
"onlouis-mcp": {
"type": "http",
"url": "https://onlouis.de/api/mcp"
}
}
}
Generic MCP
Client-specific MCP configuration
{
"name": "onlouis-mcp",
"transport": "streamable-http",
"url": "https://onlouis.de/api/mcp"
}
MCP Inspector
Run the official MCP Inspector locally and enter the indexed Streamable HTTP endpoint.
TRUST AND VERIFICATION EVIDENCE
Trust Data Available
BuiltWith Trust API v2 evidence for onlouis.de was fetched 2026-09-21T22:58:44.080Z.
onlouis.de is assessed as Trusted: Domain has an established technology history spanning over a year.
Evidence is source-attributed and does not guarantee that a third-party server is safe. Risk labels are conservative metadata heuristics.