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.

A171507 a(n) = (5*2^(n+1)-9-(-1)^n)/6-2*n.

Original entry on oeis.org

0, 0, 1, 6, 17, 42, 93, 198, 409, 834, 1685, 3390, 6801, 13626, 27277, 54582, 109193, 218418, 436869, 873774, 1747585, 3495210, 6990461, 13980966, 27961977, 55924002, 111848053, 223696158, 447392369, 894784794, 1789569645, 3579139350, 7158278761, 14316557586
Offset: 0

Views

Author

Paul Curtz, Dec 10 2009

Keywords

Crossrefs

Programs

Formula

a(n) = 3*a(n-1)-a(n-2)-3*a(n-3)+2*a(n-4). G.f.: x^2*(1+3*x)/((1+x)*(1-2*x)*(1-x)^2).
a(n) = A084640(n) - A042948(n).
a(n+1)-2*a(n) = A042948(n+1).
First differences: a(n+1)-a(n) = A084640(n).
Last digits: a(n) == a(n+10) (mod 10), n>=1.

Extensions

Edited and extended by R. J. Mathar, Dec 15 2009