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.

A284384 Alternate A167381(n), A167381(n) + 1.

Original entry on oeis.org

0, 1, 1, 2, 3, 4, 6, 7, 10, 11, 14, 15, 18, 19, 23, 24, 29, 30, 35, 36, 41, 42, 47, 48, 53, 54, 60, 61, 68, 69, 76, 77, 84, 85, 92, 93, 100, 101, 108, 109, 116, 117, 125, 126, 135, 136, 145, 146, 155, 156, 165, 166, 175, 176, 185, 186, 195, 196, 205, 206, 215, 216
Offset: 0

Views

Author

Paul Curtz, Mar 26 2017

Keywords

Comments

The first differences (a(n+1) - a(n)) are b(n) = 1, 0, 1, 1, 1, 2, 1, 3, 1, 3, 1, 3, 1, 4, 1, 5, 1, 5, 1, 5, 1, 5, 1, 5, 1, 6, 1, 7, 1, 7, ... .
b(2n+1) = 0, 1, 2, 3, 3, 3, 4, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 8, ... =
0, 1,
2, 3, 3, 3
4, 5, 5, 5, 5, 5,
6, 7, 7, 7, 7, 7, 7, 7,
...
= 2*n followed by 2*n+1 times 2*n+1 (by rows) = A282692(n)?
= A284359(n) - 1.

Crossrefs