This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
Paul Bourdelais has authored 18 sequences. Here are the ten most recent ones:
3 is a term since (34^3 + 1)/35 = 1123 is a prime.
Do[ If[ PrimeQ[ (34^n+1)/35], Print[n]], {n, 0, 18000}]
is(n) = my(q=(34^n+1)/35); (denominator(q)==1) && ispseudoprime(q);
3 is a term since (81^3 + 1)/82 = 6481 is a prime.
Do[ If[ PrimeQ[ (81^n+1)/82], Print[n]], {n, 0, 1000000}]
is(n)=isprime((81^n+1)/82)
313 is a term since (35^313 - 1)/34 is a prime. It has 482 digits in base 10.
Do[ If[ PrimeQ[ (35^n-1)/34], Print[n]], {n, 0, 600000}]
is(n)=isprime((35^n-1)/34)
2 is a member since (42^2-1)/41 = 43 is prime.
Do[ If[ PrimeQ[ (42^n-1)/41], Print[n]], {n, 2, 400000}]
is(n)=isprime((42^n-1)/41)
3 is a term since (100^3 + 1)/101 = 9901 is a prime.
Do[ If[ PrimeQ[ (100^n + 1)/101], Print[n]], {n, 0, 18000}]
is(n)=isprime((100^n+1)/101)
1 is a term since 20^1 - 3 = 17 is a prime.
Do[ If[ PrimeQ[ 20^n - 3], Print[n]], {n, 0, 200000}]
is(n)=isprime(20^n - 3)
1 is a term since 14^1 - 3 = 11 is a prime.
Do[ If[ PrimeQ[ 14^n - 3], Print[n]], {n, 0, 300000}]
is(n)=isprime(14^n - 3)
1 is a term since 14^1 + 3 = 17 is a prime.
Do[ If[ PrimeQ[ 14^n + 3], Print[n]], {n, 0, 200000}]
is(n)=isprime(14^n + 3)
1 is a term since 20^1 + 3 = 23 is a prime.
Do[ If[ PrimeQ[ 20^n + 3], Print[n]], {n, 0, 100000}]
is(n)=isprime(20^n + 3)
Do[p=Prime[n]; If[PrimeQ[(144^p + 1)/145], Print[p]], {n, 1, 1000000}]
is(n)=ispseudoprime((144^n+1)/145)
Comments