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!)
A066981 Number of residues of Lucas numbers modulo n. 2

%I #4 Oct 30 2022 18:19:59

%S 1,2,3,4,4,6,7,6,9,8,7,10,12,14,7,11,16,11,12,10,13,14,19,14,12,24,27,

%T 20,10,14,19,22,17,20,13,15,28,13,24,10,19,26,33,20,17,21,15,17,37,24,

%U 31,36,44,29,16,28,29,20,37,18,28,21,33,42,16,34,51,26,33,26,44,17,56

%N Number of residues of Lucas numbers modulo n.

%e a(15)=7, since Lucas numbers reduced modulo 15 are {1, 2, 3, 4, 7, 11, 14}.

%t Table[Length[Union[Mod[LucasL[Range[500]],n]]],{n,75}] (* _Harvey P. Dale_, Dec 17 2014 *)

%Y Cf. A000032, A066853.

%K nonn

%O 1,2

%A _Reiner Martin_, Jan 26 2002

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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)