A265907 a(1) = 1; for n > 1, a(n) = a(n-1) + A255411(a(n-1)).

1, 5, 27, 283, 2783, 27381, 289573, 3294929, 39857103, 518345071, 13445878403, 294076667433, 6072420019897, 124655463124661, 2601261501948003, 56085731405159779, 1245017012007286199, 28675043602269632757, 682496208885074229469, 16855397487443215829585, 430393080285140358451479, 11389515859337776256294767

Offset

1,2

Comments

In factorial base (A007623) these numbers look as:

1, 21, 1011, 21301, 350321, 5300311, 71310201, 905513221, <the first term with digit-value "10">, ...

Links

Antti Karttunen, Table of n, a(n) for n = 1..120

Index entries for sequences related to factorial base representation

Formula

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

Prog

(Scheme, with memoization-macro definec)
(definec (A265907 n) (if (= 1 n) n (+ (A265907 (- n 1)) (A255411 (A265907 (- n 1))))))

Crossrefs

Row 1 of A275960.

Binomial transform of A275965 (when both are considered as offset-0 sequences).

Cf. A007623, A255411.

Cf. A265908 (first differences), A265905 (variant).

Subsequence of A256450.

Sequence in context: A360726 A360712 A300621 * A360732 A135627 A244655

Adjacent sequences: A265904 A265905 A265906 * A265908 A265909 A265910

Keyword

nonn,base

Author

Antti Karttunen, Dec 20 2015

Extensions

Note about binomial transform corrected - Antti Karttunen, Sep 20 2016

Status

approved