vccs
Composable charting components for Vue 3, ported from Recharts
Gallery and interactive 3-D atlas of the decomposition into weight × level + jump, a(n) = k·L + d, for 5000 integer sequences from the OEIS, 10⁵ terms each.
DataHTML · CGitHub @decompwljOnlineOwner unconfirmed
Have you tried it? One tap is enough. No sign-in needed.
No updates detected yet. GitHub releases will appear here.
Owners of public repositories under a personal GitHub account can sign in to verify ownership and manage the introduction themselves. No administrator approval is needed.
Sign in, generate a verification file, and commit it to this repository’s default branch within 30 minutes. Files on other branches or forks do not count. Then check the file below to manage the project without administrator approval. Keep the file to retain your access.
If needed, you will go to sign-in. After signing in, return here and press your chosen verification button again.
Run /nomorevibe verify in your project folder to verify ownership and manage the introduction yourself.
Verify in one minuteAsk about other verification options
5000 sequences decomposed into weight × level + jump with interactive 3D/2D three.js graphs
Taken from the repository README
Loading the full README. The saved excerpt is shown below.
An interactive atlas of integer sequences, seen through one simple decomposition.
5000 sequences from the OEIS, 10⁵ terms each, as a gallery of plates and an
explorable 3-D point cloud.
Every term of a strictly increasing sequence is written as a product plus a jump:
a(n) = k · L + d jump d = a(n+1) − a(n) · weight k = the least divisor of a − d above d · level L = (a − d)/kRead the full README ↗The full README is unavailable right now. Read it at the original link. The saved excerpt is shown below.
An interactive atlas of integer sequences, seen through one simple decomposition.
5000 sequences from the OEIS, 10⁵ terms each, as a gallery of plates and an
explorable 3-D point cloud.
Every term of a strictly increasing sequence is written as a product plus a jump:
a(n) = k · L + d jump d = a(n+1) − a(n) · weight k = the least divisor of a − d above d · level L = (a − d)/kRead the full README ↗