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.

A079319 a(0) = 1; for n >= 1, a(n) = 4*a(n-1) - (2^n-1).

Original entry on oeis.org

1, 3, 9, 29, 101, 373, 1429, 5589, 22101, 87893, 350549, 1400149, 5596501, 22377813, 89494869, 357946709, 1431721301, 5726754133, 22906754389, 91626493269, 366504924501, 1466017600853, 5864066209109, 23456256447829
Offset: 0

Views

Author

N. J. A. Sloane, Feb 12 2003

Keywords

Crossrefs

Programs

  • Mathematica
    A079319list[nmax_]:=LinearRecurrence[{7,-14,8},{1,3,9},nmax+1];A079319list[50] (* Paolo Xausa, Jul 30 2023 *)
  • PARI
    a(n)=if(n<0,0,2^n+(4^n-1)/3)
    
  • Python
    A079319=lambda n: 2**n + 4**n//3 # M. F. Hasler, May 28 2024

Formula

a(n) = 2^n + (4^n-1)/3, n>=0.
a(n) = Sum_{i = 0..2^n - 1} A079314(i).
G.f.: (1-4x+2x^2)/((1-x)(1-2x)(1-4x)).