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.

Showing 1-3 of 3 results.

A174055 Sums of three Mersenne primes.

Original entry on oeis.org

9, 13, 17, 21, 37, 41, 45, 65, 69, 93, 133, 137, 141, 161, 165, 189, 257, 261, 285, 381, 8197, 8201, 8205, 8225, 8229, 8253, 8321, 8325, 8349, 8445, 16385, 16389, 16413, 16509, 24573, 131077, 131081, 131085, 131105, 131109, 131133, 131201, 131205, 131229, 131325, 139265, 139269, 139293, 139389, 147453, 262145, 262149
Offset: 1

Views

Author

Jonathan Vos Post, Mar 06 2010

Keywords

Examples

			a(1) = 3 + 3 + 3 = 9. a(2) = 3 + 3 + 7 = 13. a(3) = 3 + 7 + 7 = 17. a(4) = 7 + 7 + 7 = 21. a(5) = 3 + 3 + 31 = 37. a(6) = 3 + 7 + 31 = 41.

Links

Crossrefs

Cf. A000668, A155877, A166484, A171251, A171252, A171253, A171254, A171255, A174056, A174057.

Programs

  • Maple
    N:= 10^6: # to get all terms <= N
for n from 1 while numtheory:-mersenne([n]) < N do od:
S:= {seq(numtheory:-mersenne([i]),i=1..n-1)}:
sort(convert(select(`<=`,{seq(seq(seq(s+t+u,s=S),t=S),u=S)},N),list)); # Robert Israel, Mar 02 2016

Formula

A000668(i) + A000668(j) + A000668(k), with integers i,j,k not necessarily distinct. The subsequence of prime sums of three Mersenne primes is A174056.

Extensions

More terms from Max Alekseyev, Oct 15 2012
Edited by Robert Israel, Mar 02 2016

A174056 Prime sums of three Mersenne primes. Primes in A174055.

Original entry on oeis.org

13, 17, 37, 41, 137, 257, 2147483777, 162259895799233006081715459850241
Offset: 1

Views

Author

Jonathan Vos Post, Mar 06 2010

Keywords

Comments

Sums of five Mersenne primes can also be prime (though, obviously sums of an even number of Mersenne primes are even).
3 + 3 + 3 + 3 + 7 = 19
3 + 3 + 3 + 7 + 7 = 23
3 + 7 + 7 + 7 + 7 = 31
3 + 3 + 3 + 3 + 31 = 43
3 + 3 + 3 + 7 + 31 = 47
7 + 7 + 7 + 7 + 31 = 59
3 + 3 + 3 + 31 + 31 = 71
3 + 7 + 7+ 31 + 31 = 79
That sequence of sums of five Mersenne primes 19, 23, 31, 43, 47, 59, 71, 79, ... is A269666.
No other terms < 10^1000. Conjecture: these are all the terms. - Robert Israel, Mar 02 2016

Examples

			a(1) = 3 + 3 + 7 = 13. a(2) = 3 + 7 + 7 = 17. a(3) = 3 + 3 + 31 = 37. a(4) = 3 + 7 + 31 = 41. a(5) = 3 + 7 + 127 = 137. a(6) = 3 + 127 + 127 = 257.

Crossrefs

Cf. A000668, A171251, A171252, A171253, A171254, A171255, A174055, A174057, A269666.
Cf. A155877 (sums of three Fermat numbers).
Cf. A166484 (prime sums of three Fermat numbers).

Programs

  • Maple
    N:= 10^1000: # to get all terms <= N
for n from 1 while numtheory:-mersenne([n]) < N do od:
S:= {seq(numtheory:-mersenne([i]),i=1..n-1)}:
sort(select(isprime,convert(select(`<=`,{seq(seq(seq(s+t+u,s=S),t=S),u=S)},N),list))); # Robert Israel, Mar 02 2016
  • Mathematica
    Select[Total/@Tuples[Table[2^MersennePrimeExponent[n]-1,{n,20}],3],PrimeQ]//Union (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Sep 22 2020 *)

Formula

A000668(i) + A000668(j) + A000668(k), with integers i,j,k not necessarily distinct. The supersequence of sums of three Mersenne primes is A174055.

Extensions

a(7)-a(8) from Donovan Johnson, Dec 22 2010

A168335 Numbers of the form A019434(i) + A000668(j).

Original entry on oeis.org

6, 8, 10, 12, 20, 24, 34, 36, 48, 130, 132, 144, 260, 264, 288, 384, 8194, 8196, 8208, 8448, 65540, 65544, 65568, 65664, 73728, 131074, 131076, 131088, 131328, 196608, 524290, 524292, 524304, 524544, 589824, 2147483650, 2147483652, 2147483664, 2147483904
Offset: 1

Views

Author

Jonathan Vos Post, Mar 05 2010

Keywords

Crossrefs

Cf. A174057.

Extensions

Corrected and extended by R. J. Mathar, Mar 06 2010
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.