The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277801 a(n) = 2^(n - 1) - prime(n). 0

%I #19 Dec 29 2016 03:15:42

%S -1,-1,-1,1,5,19,47,109,233,483,993,2011,4055,8149,16337,32715,65477,

%T 131011,262077,524217,1048503,2097073,4194221,8388519,16777119,

%U 33554331,67108761,134217621,268435347,536870799,1073741697,2147483517,4294967159,8589934453,17179869035

%N a(n) = 2^(n - 1) - prime(n).

%C Obviously all terms are odd. Only the first three terms are negative.

%C The law of small numbers says there are not enough small numbers for all the demands placed on them.

%C I think one of those demands is that there be a strong correlation between the powers of 2 and the prime numbers. The first four primes and the first four powers of 2 deliver. But then the powers of 2 rise, literally, exponentially, leaving the primes behind in the dust.

%F a(n) is approximately 2^(n - 1).

%t Table[2^(n - 1) - Prime[n], {n, 35}]

%Y Cf. A111209.

%K sign,easy

%O 1,5

%A _Alonso del Arte_, Oct 31 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 21:51 EDT 2024. Contains 372523 sequences. (Running on oeis4.)