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.

A195463 a(n) = 4^(n+1) + 7.

Original entry on oeis.org

11, 23, 71, 263, 1031, 4103, 16391, 65543, 262151, 1048583, 4194311, 16777223, 67108871, 268435463, 1073741831, 4294967303, 17179869191, 68719476743, 274877906951, 1099511627783, 4398046511111, 17592186044423, 70368744177671, 281474976710663, 1125899906842631
Offset: 0

Views

Author

Brad Clardy, Sep 19 2011

Keywords

Comments

These are the even terms of A168415. Since the odd terms of A168415 are divisible by three the primes of this sequence are the same as A104066.

Crossrefs

Programs

Formula

a(n) = 4^(n+1) + 7.
From Alexander R. Povolotsky, Sep 19 2011: (Start)
G.f.: (11 - 32*x)/(1 - 5*x + 4*x^2).
a(n+1) = 4*a(n) - 21. (End)
a(n) = A188165(2*n+2) - 2. - Bruno Berselli, Sep 26 2011
E.g.f.: exp(x)*(4*exp(3*x) + 7). - Elmo R. Oliveira, Feb 20 2025