A354534 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A354534

Even terms in A354525 that are not twice the Mersenne primes (A000668).

2, 1022, 295147905179352825854, 348449143727040986586495598010130648530942

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Terms in A354533 that are not twice the Mersenne primes. Note that all twice the Mersenne primes are in A354533.

LINKS

Table of n, a(n) for n=1..4.

FORMULA

a(n) = 2*(2^A354532(n) - 1).

EXAMPLE

See A354532.

PROG

(PARI) lista(nn, {lim=256}, {lim_p=1<<32}) = for(n=1, nn, if(isA354532(n, lim, lim_p), print1(2*(2^n-1), ", "))) \\ See A354532 for the function isA354532

CROSSREFS

Cf. A006530, A354525, A354532, A354533, A354537.

Sequence in context: A370557 A024033 A255569 * A004897 A004802 A294279

Adjacent sequences: A354531 A354532 A354533 * A354535 A354536 A354537

KEYWORD

nonn,hard,more

AUTHOR

Jianing Song, Aug 16 2022

STATUS

approved