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.

A230405 a(n) = A000217(A230404(n+1)); the first differences of A219650.

Original entry on oeis.org

1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 10, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 6, 1, 1, 3
Offset: 0

Views

Author

Antti Karttunen, Oct 31 2013

Keywords

Comments

Construction: Count the trailing zeros in the factorial base representation (A007623) of 2n+2 (2, 4, 6, 8, ...) and then take the corresponding triangular number from A000217.

Crossrefs

First differences of A219650. Can be used to compute A219650 and A230412.
Cf. also A230413.

Formula

a(n) = A000217(A230404(n+1)).
a(n) = A219650(n+1) - A219650(n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=0..m} a(k) = 2. - Amiram Eldar, Jan 05 2024