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,3

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

Formula

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

Prog

(Scheme, with Antti Karttunen's IntSeq-library)
(define A230408 (PARTIALSUMS 0 0 (COMPOSE abs A230407)))
;; Or directly, using memoization macro definec from the same library:
(definec (A230408 n) (if (zero? n) n (+ (abs (A230407 n)) (A230408 (- n 1)))))

Crossrefs

Cf. A230407, A230409.

Sequence in context: A140180 A175324 A056704 * A163624 A353356 A363890

Adjacent sequences: A230405 A230406 A230407 * A230409 A230410 A230411

Keyword

nonn

Author

Antti Karttunen, Nov 10 2013

Status

approved