| CARVIEW |
Select Language
HTTP/2 200
date: Sun, 12 Oct 2025 03:25:29 GMT
content-type: text/html; charset=UTF-8
server: cloudflare
x-frame-options: DENY
x-content-type-options: nosniff
x-xss-protection: 1;mode=block
vary: accept-encoding
cf-cache-status: DYNAMIC
content-encoding: gzip
set-cookie: _csrf-frontend=be788e2f9a6ea9c5745652a2a9be6347fac9db2e8a4ed87bc493f1005ddcc0d5a%3A2%3A%7Bi%3A0%3Bs%3A14%3A%22_csrf-frontend%22%3Bi%3A1%3Bs%3A32%3A%22eoA3jZqfufJ-nOUp_7Rbm7lAdXez1MT5%22%3B%7D; HttpOnly; Path=/
cf-ray: 98d37d7f3d1fb155-BLR
Joerg Arndt's PARI-GP sequencer program for A055881 - Pastebin.com
SHARE
TWEET
Joerg Arndt's PARI-GP sequencer program for A055881
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- Example program about A055881, _Joerg Arndt_, Dec 15 2012
- */
- v055881(n)= /* Compute the first n! terms of A055881 by counting in rising factorial base. */ { my( fc=vector(n) ); /* mixed radix numbers (rising factorial base) */ my( j=0 ); while ( 1, /* increment factorial number fc[]: */ j = 1; while ( fc[j] == j, fc[j]=0; j+=1; ); /* scan over nines */ if ( j==n, return() ); /* current is last */ fc[j] += 1; print1(" ", j ); /* A055881: position of rightmost change in fc[] */ print1(" ", fc); /* show factorial number */ print(); ); }
Advertisement
Add Comment
Please, Sign In to add comment
-
⭐✅ Swapzone Glitch ✅ Working ⭐⭐ P
JavaScript | 5 sec ago | 0.25 KB
-
⭐⭐⭐Make $15OO in 2O minutesV E⭐⭐
Java | 6 sec ago | 0.10 KB
-
Free Crypto Method (NEVER SEEN BEFORE)⭐⭐ X
JavaScript | 11 sec ago | 0.25 KB
-
✅ Make $2500 in 20 minutes⭐⭐⭐ E
JavaScript | 14 sec ago | 0.25 KB
-
⭐⭐⭐Instant Profit Method⭐⭐
Java | 17 sec ago | 0.10 KB
-
⭐✅ Swapzone Glitch ✅ Working ⭐⭐ X
JavaScript | 20 sec ago | 0.25 KB
-
📌 Swapzone +37% glitch ⭐ T
JavaScript | 23 sec ago | 0.25 KB
-
⭐⭐⭐Exploit 500$ in 15 Minutes⭐⭐
Java | 28 sec ago | 0.10 KB
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
