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!)
A073023 Number of solutions to the equation n^x==1 (modx) 1<=x<=n. 0
1, 1, 2, 2, 3, 2, 5, 2, 4, 3, 7, 2, 8, 2, 6, 5, 7, 2, 11, 2, 8, 5, 11, 2, 12, 3, 9, 4, 14, 2, 18, 2, 7, 6, 12, 5, 16, 2, 10, 6, 19, 2, 22, 2, 9, 9, 16, 2, 19, 3, 13, 6, 18, 2, 20, 5, 14, 7, 21, 2, 28, 2, 10, 9, 17, 5, 29, 2, 17, 6, 31, 2, 23, 2, 10, 9, 23, 5, 32, 2, 16, 5, 26, 2, 28, 6, 14, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
Conjecture: for n>100, sum(k=1, n, a(k)) > n^(3/2)
PROG
(PARI) a(n)=sum(i=1, n, if((n^i-1)%i, 0, 1))
CROSSREFS
Sequence in context: A285573 A325339 A010846 * A173754 A180125 A342086
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Aug 21 2002
STATUS
approved

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 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)