login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A096973
a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000).
2
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,1
MATHEMATICA
nxt[{a_, b_}]:={b, Mod[a+b, 20000]}; Join[{10000}, Transpose[NestList[nxt, {10000, 2}, 40]][[1]]] (* Harvey P. Dale, Oct 20 2012 *)
CROSSREFS
Sequence in context: A084474 A033422 A033433 * A153747 A033829 A371004
KEYWORD
easy,nonn
AUTHOR
Pierre CAMI, Aug 19 2004
EXTENSIONS
More terms from Harvey P. Dale, Oct 20 2012
STATUS
approved