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 S. Vanderveen's wiki page.
Paul S. Vanderveen has authored 2 sequences.
Select[Range[0, 1000], PrimeQ[6*17^# + 1] &] (* Amiram Eldar, Feb 24 2020 *)
for(i=1,10000, if( ispseudoprime(6*17^i+1), print1(i, ", ")));
A215458(3) = 7, A215458(5) = 11, A215458 (7) = 71 are all primes, hence 3, 5, 7 are in this sequence.
h := proc(n) option remember; `if`(n=0,2,`if`(n=1,1,h(n-1)-2*h(n-2))) end: select(n->isprime((2^n-h(n)+1)/2),select(isprime,[$1..1000])); # Peter Luschny, Jul 26 2017
Function[s, Keys@ KeySelect[s, AllTrue[{#, Lookup[s, #]}, PrimeQ] &]]@ MapIndexed[First[#2] - 1 -> #1 &, LinearRecurrence[{4, -7, 8, -4}, {0, 1, 4, 7}, 7000]] (* Michael De Vlieger, Jul 26 2017 *)
isprime(([0, 1, 0, 0; 0, 0, 1, 0; 0, 0, 0, 1; -4, 8, -7, 4]^n*[0; 1; 4; 7])[1, 1])
Comments