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.

A064847 Sequence a(n) such that there is a sequence b(n) with a(1) = b(1) = 1, a(n+1) = a(n) * b(n) and b(n+1) = a(n) + b(n) for n >= 1.

Table of values

n a(n)
1 1
2 1
3 2
4 6
5 30
6 330
7 13530
8 5019630
9 69777876630
10 351229105131280530
11 24509789089304573335878465330
12 8608552999157278550998626549630446732052243030

List of values

[1, 1, 2, 6, 30, 330, 13530, 5019630, 69777876630, 351229105131280530, 24509789089304573335878465330, 8608552999157278550998626549630446732052243030]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.