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.

A089279 a(n) = 2 + sum(k=1 to n) [(-1)^k A001511(k)].

Original entry on oeis.org

1, 3, 2, 5, 4, 6, 5, 9, 8, 10, 9, 12, 11, 13, 12, 17, 16, 18, 17, 20, 19, 21, 20, 24, 23, 25, 24, 27, 26, 28, 27, 33, 32, 34, 33, 36, 35, 37, 36, 40, 39, 41, 40, 43, 42, 44, 43, 48, 47, 49, 48, 51, 50, 52, 51, 55, 54, 56, 55, 58, 57, 59, 58, 65, 64, 66, 65, 68, 67, 69, 68, 72
Offset: 1

Views

Author

Gary W. Adamson, Oct 28 2003

Keywords

Comments

a(2^n) = 2^n+1.

Crossrefs

Formula

a(2n+1) = A101925(n), a(2n+2) = a(2n+3)+1. - Ralf Stephan, Dec 28 2004

Extensions

Edited by Don Reble, Nov 15 2005