A230406 a(n) = A034968(A219666(n)); after zero, the differences between successive nodes in the infinite trunk of the factorial beanstalk (A219666).
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
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 0..3149
Comments