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).

This page as a plain text file.
%I A292433 #10 Dec 08 2017 16:57:58
%S A292433 0,1,2,7,121,79988,81600798165,182421074243967704954243
%N A292433 a(0) = 0, a(1) = 1; a(n) = prime(a(n-1))*a(n-1) + a(n-2).
%e A292433 +---+-------------+--------------------+-------------------+
%e A292433 | n | a(n)/a(n+1) | Continued fraction |      Comment      |
%e A292433 +---+-------------+--------------------+-------------------+
%e A292433 | 1 |    1/2      | [0; 2]             |   2 = prime(a(1)) |
%e A292433 +---+-------------+--------------------+-------------------+
%e A292433 | 2 |    2/7      | [0; 3, 2]          |   3 = prime(a(2)) |
%e A292433 +---+-------------+--------------------+-------------------+
%e A292433 | 3 |    7/121    | [0; 17, 3, 2]      |  17 = prime(a(3)) |
%e A292433 +---+-------------+--------------------+-------------------+
%e A292433 | 4 |  121/79988  | [0; 661, 17, 3, 2] | 661 = prime(a(4)) |
%e A292433 +---+-------------+--------------------+-------------------+
%t A292433 RecurrenceTable[{a[0] == 0, a[1] == 1, a[n] == Prime[a[n - 1]] a[n - 1] + a[n - 2]}, a[n], {n, 7}]
%Y A292433 Cf. A000040, A000278, A006277, A007097, A036247, A036248, A058182, A076146, A083659.
%K A292433 nonn,more
%O A292433 0,3
%A A292433 _Ilya Gutkovskiy_, Dec 08 2017