A231574 Primes in A001590.
2, 3, 11, 37, 634061, 7256527, 1424681173049, 123937002926372177911
Offset: 1
Keywords
Extensions
Name clarified by Arthur O'Dwyer, Jul 24 2024
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[0]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[3]]=sum]
a={-1,2,2}; Print[2]; Print[2]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[sum]]; a=RotateLeft[a]; a[[3]]=sum]
a={2,1,2}; Print[2]; Print[2]; 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},{2,1,2},300],PrimeQ] (* Harvey P. Dale, Jul 30 2015 *)
a={0,2,1}; Print[2] For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[sum]]; a=RotateLeft[a]; a[[3]]=sum]
a={-1,2,2};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={0,2,1};Print[1];For[n=3,n<=1000,n++,sum=Plus@@a;If[PrimeQ[sum],Print[n]];a=RotateLeft[a]; a[[3]]=sum]
a={1, 2, 2}; Print[2]; Print[2]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[3]]=sum] Position[LinearRecurrence[{1,1,1},{1,2,2},75000],?PrimeQ]-1//Flatten (* _Harvey P. Dale, Sep 02 2016 *)
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]
Comments