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.

A178094 a(1)=a(2)=1; thereafter a(n) = lpf(a(n-1)+a(n-2)), where lpf = "least prime factor".

Original entry on oeis.org

1, 1, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7, 2, 3, 5, 2, 7, 3, 2, 5, 7
Offset: 1

Views

Author

N. J. A. Sloane, Dec 16 2010

Keywords

Comments

Cycles with a period of length 9.

Crossrefs

Programs

  • Mathematica
    nxt[{a_,b_}]:={b,FactorInteger[a+b][[1,1]]}; NestList[nxt,{1,1},110][[;;,1]] (* or *) PadRight[ {1,1},110,{5,7,2,3,5,2,7,3,2}] (* Harvey P. Dale, May 29 2023 *)