cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Dec 20 2015

Keywords

Comments

In factorial base (A007623) these numbers look as:
1, 21, 1011, 21301, 350321, 5300311, 71310201, 905513221, , ...

Crossrefs

Row 1 of A275960.
Binomial transform of A275965 (when both are considered as offset-0 sequences).
Cf. A265908 (first differences), A265905 (variant).
Subsequence of A256450.

Formula

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

Extensions

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