cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A066981 Number of residues of Lucas numbers modulo n.

Original entry on oeis.org

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, 20, 10, 14, 19, 22, 17, 20, 13, 15, 28, 13, 24, 10, 19, 26, 33, 20, 17, 21, 15, 17, 37, 24, 31, 36, 44, 29, 16, 28, 29, 20, 37, 18, 28, 21, 33, 42, 16, 34, 51, 26, 33, 26, 44, 17, 56
Offset: 1

Views

Author

Reiner Martin, Jan 26 2002

Keywords

Examples

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

Crossrefs

Programs

  • Mathematica
    Table[Length[Union[Mod[LucasL[Range[500]],n]]],{n,75}] (* Harvey P. Dale, Dec 17 2014 *)