login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A117659 Number of solutions to x^(k+2)=x^k mod n for some k>=1. 1
1, 2, 3, 4, 3, 6, 3, 8, 5, 6, 3, 12, 3, 6, 9, 12, 3, 10, 3, 12, 9, 6, 3, 24, 7, 6, 11, 12, 3, 18, 3, 20, 9, 6, 9, 20, 3, 6, 9, 24, 3, 18, 3, 12, 15, 6, 3, 36, 9, 14, 9, 12, 3, 22, 9, 24, 9, 6, 3, 36, 3, 6, 15, 36, 9, 18, 3, 12, 9, 18, 3, 40, 3, 6, 21 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

S. R. Finch, Idempotents and Nilpotents Modulo n (arXiv:math.NT/0605019)

CROSSREFS

Sequence in context: A080383 A086369 A092089 * A079065 A097272 A126630

Adjacent sequences:  A117656 A117657 A117658 * A117660 A117661 A117662

KEYWORD

mult,nonn

AUTHOR

S. R. Finch (Steven.Finch(AT)inria.fr), Apr 11 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 23:05 EST 2012. Contains 206085 sequences.