Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117658
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117658 Number of solutions to x^(k+1)=x^k mod n for some k>=1. +0
1
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; listen)
OFFSET

1,2

LINKS

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

CROSSREFS

Sequence in context: A101296 A077462 A129294 this_sequence A067540 A087050 A065770

Adjacent sequences: A117655 A117656 A117657 this_sequence A117659 A117660 A117661

KEYWORD

mult,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research