The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A114307 Length of the cycle for Lucas numbers mod 10^n. 1
 12, 60, 300, 3000, 30000, 300000, 3000000, 30000000, 300000000, 3000000000, 30000000000, 300000000000, 3000000000000, 30000000000000, 300000000000000, 3000000000000000, 30000000000000000, 300000000000000000, 3000000000000000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This is the length of the cycle for final n decimal digits in Lucas numbers (A000032) LINKS Eric Weisstein's World of Mathematics, Lucas Number FORMULA a(1)=12, a(2)=60, a(n)=3*10^(n-1) for n>2. a(n)=lcm(3*2^(n-1),4*5^(n-1)). In particular, for n>=3, a(n) = 3*10^(n-1). - Max Alekseyev, May 17 2006 EXAMPLE L(i) mod 10 = L(i+12) mod 10; L(i) mod 10^2 = L(i+a(2)) mod 10^2; L(i) mod 10^3 = L(i+a(3)) mod 10^3; CROSSREFS Cf. A000032, A096363, A001175. Sequence in context: A074433 A280175 A216491 * A009031 A009136 A053533 Adjacent sequences:  A114304 A114305 A114306 * A114308 A114309 A114310 KEYWORD easy,nonn AUTHOR Jerzy Podgorski (j.podgorski(AT)pollub.pl), May 14 2006; corrected May 16 2006 EXTENSIONS More terms from Max Alekseyev, May 17 2006 STATUS approved

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

Last modified May 14 13:50 EDT 2021. Contains 343884 sequences. (Running on oeis4.)