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.

A255337 After a(0) = 0, the first differences of A255057: for n >= 1: a(n) = A255057(n) - A255057(n-1).

Original entry on oeis.org

0, 1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 1, 1, 2, 3, 2, 2, 2, 2, 1, 1, 1, 2, 3, 2, 3, 3, 2, 1, 2, 3, 2, 2, 2, 2, 1, 1, 1, 2, 3, 2, 3, 2, 2, 3, 3, 3, 3, 3, 2, 1, 2, 3, 2, 3, 3, 2, 1, 2, 3, 2, 2, 2, 2, 1, 1, 1, 2, 3, 2, 3, 2, 2, 3, 3, 3, 3, 2, 2, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 2, 1, 2, 3, 2, 3, 2, 2, 3, 3, 3, 3, 3, 2, 1, 2, 3, 2, 3, 3, 2, 1, 2, 3, 2, 2, 2, 2, 1, 1
Offset: 0

Views

Author

Antti Karttunen, Feb 21 2015

Keywords

Comments

Used for computing A255338 and A255339.

Crossrefs

First differences of A255057.
Terms of A255336 divided by 2.

Formula

a(n) = A005811(A255056(n))/2.
a(0) = 0; and for n >= 1: a(n) = A255057(n) - A255057(n-1).
a(n) = A255336(n)/2.