(Translated by https://www.hiragana.jp/)
A230413 - OEIS
login
A230413
a(0)=0 and from then on, the partial sums of A230412 summed from the term a(1) onward.
4
0, 1, 2, 2, 2, 3, 4, 5, 5, 5, 6, 7, 8, 8, 8, 9, 10, 11, 11, 11, 11, 11, 11, 12, 13, 14, 14, 14, 15, 16, 17, 17, 17, 18, 19, 20, 20, 20, 21, 22, 23, 23, 23, 23, 23, 23, 24, 25, 26, 26, 26, 27, 28, 29, 29, 29, 30, 31, 32, 32, 32, 33, 34, 35, 35, 35, 35, 35, 35
OFFSET
0,3
COMMENTS
Alternatively, one less than the partial sums of A230412 summed from the beginning.
Each n occurs A230405(n) times.
Together with A230412 can be used to compute A230414, A230423 and A230424.
LINKS
FORMULA
a(0) = 0; and for n>=1, a(n) = A230413(n-1) + A230412(n).
a(A219650(n)) = n for all n.
PROG
(Scheme, with memoizing definec-macro from Antti Karttunen's IntSeq-library)
(definec (A230413 n) (if (zero? n) 0 (+ (A230413 (- n 1)) (A230412 n))))
CROSSREFS
Cf. also A230405, A230412, A230414.
This sequence relates to the factorial base representation (A007623) in a similar way as A046699 relates to the binary system.
Sequence in context: A285509 A194813 A096533 * A029096 A194820 A076872
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 02 2013
STATUS
approved