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.

A233270 a(n) = A233271(n) - A179016(n).

Original entry on oeis.org

0, 0, -1, 0, 0, 0, 1, 0, 0, 2, 1, 2, 0, 0, 3, 3, 4, 3, 4, 3, 3, 0, 0, 4, 4, 5, 4, 6, 5, 5, 3, 5, 5, 6, 4, 5, 4, 4, 0, 0, 5, 8, 9, 10, 13, 13, 15, 16, 17, 18, 18, 17, 17, 19, 19, 17, 17, 18, 18, 17, 16, 15, 13, 13, 10, 9, 8, 5, 0, 0, 6, 9, 14, 17, 18, 20, 22, 21
Offset: 0

Views

Author

Antti Karttunen, Dec 14 2013

Keywords

Comments

For all n>=2, a(1+A213710(n)) = n-2.
Except for a(2)=-1 (which seems to be the only negative term in the sequence), the sequences A218600 and A213710 give the positions of zeros.
Furthermore, each subrange [A213710(n)..A218600(n+1)] is palindromic. A233268 gives the middle points of those ranges, the sequence A234018 gives the values at those points, while A234019 gives the maximum term in that range in this sequence.

Examples

			This irregular table begins as:
0;
0;
-1;
0, 0;
0, 1, 0;
0, 2, 1, 2, 0;
0, 3, 3, 4, 3, 4, 3, 3, 0;
0, 4, 4, 5, 4, 6, 5, 5, 3, 5, 5, 6, 4, 5, 4, 4, 0;
...
After zero, each row n is A213709(n-1) elements long.
		

Crossrefs

Except for a(2)=-1 (which seems to be the only negative term in the sequence), the sequences A218600 and A213710 give the positions of zeros.

Programs

Formula

a(n) = A233271(n) - A179016(n).
a(A218602(n)) = a(n). [This is just a claim that each row is palindrome]