A276952 Partial sums of A276950.

0, 1, 1, 2, 3, 4, 4, 5, 5, 6, 7, 8, 8, 9, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 18, 19, 19, 20, 21, 22, 22, 23, 23, 24, 25, 26, 26, 27, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 36, 37, 37, 38, 39, 40, 40, 41, 41, 42, 43, 44, 44, 45, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 54, 55, 55, 56, 57, 58, 58, 59, 59, 60, 61

Offset

0,4

Comments

Each n occurs A276948(n) times.

Links

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

Index entries for sequences related to factorial base representation

Formula

a(0) = 0; for n >= 1, a(n) = A276950(n) + a(n-1).

Other identities. For all n >= 1:

a(n) = 1 + A273663(n).

Prog

(Scheme)
(define (A276952 n) (+ 1 (A273663 n)))
(definec (A276952 n) (if (zero? n) n (+ (A276950 n) (A276952 (- n 1)))))

Crossrefs

One more than A273663.

Cf. also A276948, A276951, A257682.

Sequence in context: A005374 A206767 A071991 * A096336 A358062 A081609

Adjacent sequences: A276949 A276950 A276951 * A276953 A276954 A276955

Keyword

nonn,base

Author

Antti Karttunen, Sep 22 2016

Status

approved