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.

A062709 a(n) = 2^n + 3.

Original entry on oeis.org

4, 5, 7, 11, 19, 35, 67, 131, 259, 515, 1027, 2051, 4099, 8195, 16387, 32771, 65539, 131075, 262147, 524291, 1048579, 2097155, 4194307, 8388611, 16777219, 33554435, 67108867, 134217731, 268435459, 536870915, 1073741827, 2147483651, 4294967299, 8589934595, 17179869187
Offset: 0

Views

Author

Henry Bottomley, Jul 13 2001

Keywords

Comments

Written in binary a(n) is 1000...00011 for n > 1.
For n >= 2, a(n) is the minimal k for which A000120(k(2^n-1)) is not multiple of n. - Vladimir Shevelev, Jun 05 2009

Examples

			a(3) = 2^3 + 3 = 8 + 3 = 11.
a(4) = 2^4 + 3 = 16 + 3 = 19.
		

Crossrefs

Primes in this sequence are A057733.

Programs

Formula

a(n) = 2a(n-1) - 3 = A052548(n) + 1 = A000051(n) + 2 = A000079(n) + 3 = A000225(n) + 4 = A030101(A004119(n)) for n > 1.
G.f.: (4 - 7*x)/((1 - 2*x)*(1 - x)).
a(n) = A173921(A000051(n+1)). - Reinhard Zumkeller, Mar 04 2010
E.g.f.: exp(x)*(3 + exp(x)). - Stefano Spezia, May 06 2023