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.
%I A348791 #15 Dec 01 2021 01:37:52 %S A348791 1,5,83,863,311,1837067,254298349,2372135461 %N A348791 a(n) is the smallest prime that can be written as the sum of a prime number of consecutive primes in exactly n ways, or -1 if no such number exists. %e A348791 a(2) = 83 from 83 = 11+13+17+19+23 (5 primes) = 23+29+31 (3 primes). %e A348791 a(4) = 311 from %e A348791 311 = 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 (11 primes) %e A348791 = 31 + 37 + 41 + 43 + 47 + 53 + 59 (7 primes) %e A348791 = 53 + 59 + 61 + 67 + 71 (5 primes) %e A348791 = 101 + 103 + 107 (3 primes). %Y A348791 Cf. A082283. %Y A348791 See A348790 for a different version. %K A348791 nonn,more,hard %O A348791 0,2 %A A348791 _Harvey P. Dale_ and _N. J. A. Sloane_, Nov 30 2021 %E A348791 a(6) from _Michael S. Branicky_, Nov 30 2021 %E A348791 a(7) from _Michael S. Branicky_, Dec 01 2021