login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096973 a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000). 2

%I #5 Oct 20 2012 14:53:38

%S 10000,10000,2,10002,10004,6,10010,10016,26,10042,10068,110,10178,

%T 10288,466,10754,11220,1974,13194,15168,8362,3530,11892,15422,7314,

%U 2736,10050,12786,2836,15622,18458,14080,12538,6618,19156,5774,4930,10704,15634,6338

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

%t nxt[{a_,b_}]:={b,Mod[a+b,20000]}; Join[{10000},Transpose[NestList[nxt,{10000,2},40]][[1]]] (* _Harvey P. Dale_, Oct 20 2012 *)

%K easy,nonn

%O 1,1

%A _Pierre CAMI_, Aug 19 2004

%E More terms from _Harvey P. Dale_, Oct 20 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 5 01:52 EDT 2024. Contains 372257 sequences. (Running on oeis4.)