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.
a={3,1,1}; Print[3]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[sum]]; a=RotateLeft[a]; a[[3]]=sum]
a={1,1,1,1,1,1}; For[n=6, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[sum]]; a=RotateLeft[a]; a[[5]]=sum]
a={0,0,1,0}; For[n=4, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[4]]=sum]
a={0,0,1,2}; Print[3]; For[n=4, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[4]]=sum]
a={1,7,7}; Print["1"]; Print["2"]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[3]]=sum]
a={1,5,5}; Print[1];Print[2]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[3]]=sum]
a={1,1,1,1}; For[n=4, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[4]]=sum]
Flatten[Position[LinearRecurrence[{1,1,1,1},{1,1,1,1},10^5], ?PrimeQ]]- 1 (* _Harvey P. Dale, Dec 20 2016 *)
a={1,6,6}; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[sum]]; a=RotateLeft[a]; a[[3]]=sum]
Select[LinearRecurrence[{1,1,1},{1,6,6},350],PrimeQ] (* Harvey P. Dale, Jul 21 2018 *)
my(x='x+O('x^500)); select(isprime, Vec((1+5*x-x^2)/(1-x-x^2-x^3))) \\ Michel Marcus, Jun 16 2025
f:= gfun:-rectoproc({a(n) = a(n-1) + a(n-2) + a(n-3), a(0) = 1, a(1) = 7, a(2) = 7},a(n),remember):
select(isprime, map(f, [$2..1000])); # Robert Israel, Sep 02 2024
a={1,7,7}; Print["7"]; Print["7"]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[sum]]; a=RotateLeft[a]; a[[3]]=sum]
a={1,1,1,1,1}; For[n=5, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[5]]=sum]
Comments