# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a223487
Showing 1-1 of 1

%I A223487 #10 Nov 19 2015 02:46:26
%S A223487 0,0,0,0,1,0,0,2,0,2,4,2,1,0,8,5,1,7,7,10,8,8,4,10,13,2,0,8,19,16,12,
%T A223487 10,16,14,22,21,9,25,15,30,22,16,10,24,28,25,32,31,12,26,20,16,9,25,
%U A223487 39,28,28,38,22,42,33,41,30,22,49,32,16,42,36,44,27,55
%N A223487 Number of missing residues in Lucas sequence mod n.
%C A223487 The Lucas numbers mod n for any n are periodic - see A106291 for period lengths.
%H A223487 T. D. Noe, <a href="/A223487/b223487.txt">Table of n, a(n) for n = 1..1000</a>
%H A223487 D. D. Wall, <a href="http://www.jstor.org/stable/2309169">Fibonacci series modulo m</a>, Amer. Math. Monthly, 67 (1960), 525-532.
%t A223487 pisano[n_] := Module[{a = {2, 1}, a0, k = 0, s, t}, If[n == 1, 1, a0 = a; t = a; While[k++; s = Mod[Plus @@ a, n]; AppendTo[t, s]; a[[1]] = a[[2]]; a[[2]] = s; a != a0]; t]]; Join[{0, 0}, Table[u = Union[pisano[n]]; mx = Max[u]; Length[Complement[Range[0, mx], u]], {n, 3, 100}]] (* _T. D. Noe_, Mar 22 2013 *)
%Y A223487 Cf. A118965.
%K A223487 nonn
%O A223487 1,8
%A A223487 _Casey Mongoven_, Mar 20 2013

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE