Search: id:A003893 Results 1-1 of 1 results found. %I A003893 %S A003893 0,1,1,2,3,5,8,3,1,4,5,9,4,3,7,0,7,7,4,1,5,6,1,7,8,5,3,8,1,9,0,9,9,8,7, %T A003893 5,2,7,9,6,5,1,6,7,3,0,3,3,6,9,5,4,9,3,2,5,7,2,9,1,0,1,1,2,3,5,8,3,1,4, %U A003893 5,9,4,3,7,0,7,7,4,1,5,6,1,7,8,5,3,8,1,9,0,9,9,8,7,5,2,7,9,6,5,1,6,7,3 %N A003893 Fibonacci(n) mod 10. %C A003893 All blocks of 60 successive terms contain 20 even and 40 odd numbers. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 2005 %C A003893 a(n) = A105471(n) - A105472(n)*10 = A105471(n)/10. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 2005 %D A003893 G. Marsaglia, The mathematics of random number generators, pp. 73-90 of S. A. Burr, ed., The Unreasonable Effectiveness of Number Theory, Proc. Sympos. Appl. Math., 46 (1992). Amer. Math. Soc. %D A003893 Gregory P. Dresden, "Three transcendental numbers from the last non-zero digits of n^n, F_n and n!", 'Mathematics Magazine', pp. 96-105, vol. 81, 2008. %H A003893 R. Knott, Mathematics of the Fibonacci Series %H A003893 Index entries for sequences related to final digits of numbers %F A003893 Periodic with period 60. %F A003893 a(n) = (a(n-1) + a(n-2)) mod 10 for n>1, a(0) = 0, a(1) = 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 09 2005 %p A003893 with(combinat,fibonacci); A003893 := proc(n) fibonacci(n) mod 10; end; %t A003893 Table[f=Fibonacci[n];Mod[f,10],{n,0,30}] (Vladimir Orlovsky, Jul 21 2008) %Y A003893 Cf. A000045, A089911. %Y A003893 Sequence in context: A111301 A096320 A105955 this_sequence A152303 A064737 A098906 %Y A003893 Adjacent sequences: A003890 A003891 A003892 this_sequence A003894 A003895 A003896 %K A003893 nonn %O A003893 0,4 %A A003893 N. J. A. Sloane (njas(AT)research.att.com), ELIPPER(AT)UOFT02.UTOLEDO.EDU %E A003893 More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 15 2003 Search completed in 0.002 seconds