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.

A214331 a(n) = (a(n-1) + a(n-3))/gcd(a(n-1), a(n-3)) with a(0) =2, a(1) = 3, a(2) = 5.

This page as a plain text file.
%I A214331 #7 Jul 26 2012 21:35:17
%S A214331 2,3,5,7,10,3,10,2,5,3,5,2,5,2,2,7,9,11,18,3,14,16,19,33,49,68,101,
%T A214331 150,109,210,12,121,331,343,464,795,1138,801,532,835,1636,542,1377,
%U A214331 3013,3555,548,3561,2372,730,4291,6663,7393,11684,18347,25740,9356,27703,4111,13467,41170,45281,58748,49959,95240,38497,88456,22962,61459,149915,172877,234336,384251
%N A214331 a(n) = (a(n-1) + a(n-3))/gcd(a(n-1), a(n-3)) with a(0) =2,  a(1) = 3, a(2) = 5.
%H A214331 N. J. A. Sloane, <a href="/A214331/b214331.txt">Table of n, a(n) for n = 0..10000</a>
%p A214331 t := [2, 3, 5];
%p A214331 for n from 4 to 1000 do
%p A214331 t:=[op(t), (t[n-1]+t[n-3])/gcd(t[n-1],t[n-3])];
%p A214331 od:
%p A214331 t;
%Y A214331 Cf. A214551.
%K A214331 nonn
%O A214331 0,1
%A A214331 _N. J. A. Sloane_, Jul 26 2012