cp's OEIS Frontend

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.

A336581 Mersenne exponents whose corresponding prime can be expressed as the sum of at least two consecutive primes.

This page as a plain text file.
%I A336581 #25 Aug 31 2020 04:35:26
%S A336581 5,7,13,17,61
%N A336581 Mersenne exponents whose corresponding prime can be expressed as the sum of at least two consecutive primes.
%C A336581 127 is a term.
%H A336581 Carlos Rivera, <a href="https://www.primepuzzles.net/puzzles/puzz_456.htm">Puzzle 456. Mersenne Primes as a sum of consecutive primes</a>, The Prime Puzzles and Problems Connection.
%e A336581 5 is a term because 2^5-1 = 7 + 11 + 13.
%e A336581 17 is a term because 2^17-1 = 43669 + 43691 + 43711.
%o A336581 (PARI) isok(m) = my(p=2^m-1); isprime(p) && isA050936(p);
%Y A336581 Cf. A000043 (Mersenne exponents), A000668, A050936, A067377.
%K A336581 nonn,more
%O A336581 1,1
%A A336581 _Michel Marcus_, Aug 30 2020