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.

Original entry on oeis.org

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, 150, 109, 210, 12, 121, 331, 343, 464, 795, 1138, 801, 532, 835, 1636, 542, 1377, 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
Offset: 0

Views

Author

N. J. A. Sloane, Jul 26 2012

Keywords

Crossrefs

Cf. A214551.

Programs

  • Maple
    t := [2, 3, 5];
    for n from 4 to 1000 do
    t:=[op(t), (t[n-1]+t[n-3])/gcd(t[n-1],t[n-3])];
    od:
    t;