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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A117658 Number of solutions to x^(k+1)=x^k mod n for some k>=1. 0
1, 2, 2, 3, 2, 4, 2, 5, 4, 4, 2, 6, 2, 4, 4, 9, 2, 8, 2, 6, 4, 4, 2, 10, 6, 4, 10, 6, 2, 8, 2, 17, 4, 4, 4, 12, 2, 4, 4, 10, 2, 8, 2, 6, 8, 4, 2, 18, 8, 12, 4, 6, 2, 20, 4, 10, 4, 4, 2, 12, 2, 4, 8, 33, 4, 8, 2, 6, 4, 8, 2, 20, 2, 4, 12 (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: A181819 A077462 A129294 * A067540 A175501 A144370

Adjacent sequences:  A117655 A117656 A117657 * A117659 A117660 A117661

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 16 13:12 EST 2012. Contains 205909 sequences.