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.

A230406 a(n) = A034968(A219666(n)); after zero, the differences between successive nodes in the infinite trunk of the factorial beanstalk (A219666).

Original entry on oeis.org

0, 1, 1, 3, 2, 3, 2, 5, 6, 2, 3, 2, 5, 5, 6, 2, 4, 5, 6, 7, 4, 5, 6, 7, 5, 5, 7, 10, 2, 3, 2, 5, 5, 6, 2, 4, 5, 6, 7, 4, 5, 6, 7, 5, 5, 6, 9, 8, 7, 10, 2, 4, 5, 6, 7, 4, 5, 6, 7, 5, 5, 6, 8, 6, 8, 8, 7, 10, 11, 4, 5, 6, 7, 5, 5, 6, 8, 6, 8, 8, 7, 10, 12, 10, 11
Offset: 0

Views

Author

Antti Karttunen, Nov 09 2013

Keywords

Comments

Also the first differences of A219666, shifted once right and prepended with zero.
This sequence relates to the factorial base representation (A007623) in the same way as A213712 relates to the binary system.

Crossrefs

Cf. also A230418, A230410.

Programs

Formula

a(n) = A034968(A219666(n)).
a(0) = 0, and for n>=1, a(n) = A219666(n) - A219666(n-1).
a(A226061(n)) = A000217(n-1) for all n.