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.

A292433 a(0) = 0, a(1) = 1; a(n) = prime(a(n-1))*a(n-1) + a(n-2).

Original entry on oeis.org

0, 1, 2, 7, 121, 79988, 81600798165, 182421074243967704954243
Offset: 0

Views

Author

Ilya Gutkovskiy, Dec 08 2017

Keywords

Examples

			+---+-------------+--------------------+-------------------+
| n | a(n)/a(n+1) | Continued fraction |      Comment      |
+---+-------------+--------------------+-------------------+
| 1 |    1/2      | [0; 2]             |   2 = prime(a(1)) |
+---+-------------+--------------------+-------------------+
| 2 |    2/7      | [0; 3, 2]          |   3 = prime(a(2)) |
+---+-------------+--------------------+-------------------+
| 3 |    7/121    | [0; 17, 3, 2]      |  17 = prime(a(3)) |
+---+-------------+--------------------+-------------------+
| 4 |  121/79988  | [0; 661, 17, 3, 2] | 661 = prime(a(4)) |
+---+-------------+--------------------+-------------------+
		

Crossrefs

Programs

  • Mathematica
    RecurrenceTable[{a[0] == 0, a[1] == 1, a[n] == Prime[a[n - 1]] a[n - 1] + a[n - 2]}, a[n], {n, 7}]