A230408 Partial sums of absolute values of A230407.

0, 1, 2, 5, 10, 11, 14, 15, 18, 23, 24, 31, 32, 37, 38, 43, 48, 53, 58, 69, 70, 73, 84, 85, 88, 91, 92, 95, 100, 101, 108, 109, 114, 115, 120, 125, 130, 135, 146, 147, 150, 171, 172, 175, 178, 187, 188, 189, 194, 195, 200, 205, 210, 215, 226, 227, 230, 251, 252

Offset: 0

Author

Antti Karttunen, Nov 10 2013

Keywords

• nonn

Comments

The term a(n) tells how many nodes there are in total in all side-trees ("tendrils") encountered (see A230430) after we have climbed n steps up along the infinite trunk of the factorial beanstalk, A219666.

This sequence relates to the factorial base representation (A007623) in the same way as A218785 relates to the binary system.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..3149

Crossrefs

Cf. A230407, A230409.

Formula

a(0) = 0, a(n) = a(n-1) + |A230407(n)| [Where | | indicates the absolute value].