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.

A168415 a(n) = 2^n + 7.

Original entry on oeis.org

8, 9, 11, 15, 23, 39, 71, 135, 263, 519, 1031, 2055, 4103, 8199, 16391, 32775, 65543, 131079, 262151, 524295, 1048583, 2097159, 4194311, 8388615, 16777223, 33554439, 67108871, 134217735, 268435463, 536870919, 1073741831, 2147483655
Offset: 0

Views

Author

Vincenzo Librandi, Dec 01 2009

Keywords

Comments

a(n) is prime <=> a(n) is in A104066 <=> n is in A057195 <=> 2^(n-1)*a(n) = A257272(n) is in A125247. - M. F. Hasler, Apr 27 2015

Crossrefs

Programs

Formula

a(n) = 2*a(n-1) - 7, n > 1.
G.f.: (8 - 15*x)/((2*x - 1)*(x - 1)). - R. J. Mathar, Jul 10 2011
a(n) = A000079(n) + 7. - Omar E. Pol, Sep 20 2011
E.g.f.: exp(2*x) + 7*exp(x). - G. C. Greubel, Jul 22 2016
a(n) = 3*a(n-1) - 2*a(n-2) for n > 1. - Elmo R. Oliveira, Nov 11 2023