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.

A096973 a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000).

Original entry on oeis.org

10000, 10000, 2, 10002, 10004, 6, 10010, 10016, 26, 10042, 10068, 110, 10178, 10288, 466, 10754, 11220, 1974, 13194, 15168, 8362, 3530, 11892, 15422, 7314, 2736, 10050, 12786, 2836, 15622, 18458, 14080, 12538, 6618, 19156, 5774, 4930, 10704, 15634, 6338
Offset: 1

Views

Author

Pierre CAMI, Aug 19 2004

Keywords

Programs

  • Mathematica
    nxt[{a_,b_}]:={b,Mod[a+b,20000]}; Join[{10000},Transpose[NestList[nxt,{10000,2},40]][[1]]] (* Harvey P. Dale, Oct 20 2012 *)

Extensions

More terms from Harvey P. Dale, Oct 20 2012