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.

A070231 Let u(k), v(k), w(k) satisfy the recursions u(1) = v(1) = w(1) = 1, u(k+1) = u(k) + v(k) + w(k), v(k+1) = u(k)*v(k) + v(k)*w(k) + w(k)*u(k), and w(k+1) = u(k)*v(k)*w(k) for k >= 1; then a(n) = u(n).

Table of values

n a(n)
1 1
2 3
3 7
4 31
5 1279
6 9202687
7 3692849258577919
8 98367959484921734629696721986125823
9 3882894052327310957045599009145809243674851356642054390303168725061781159935999

List of values

[1, 3, 7, 31, 1279, 9202687, 3692849258577919, 98367959484921734629696721986125823, 3882894052327310957045599009145809243674851356642054390303168725061781159935999]