id:A073023 - OEIS Search Results

Search: id:A073023

Displaying 1-1 of 1 results found.

page 1

Number of solutions to the equation n^x==1 (modx) 1<=x<=n.

+0
1

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; listen)

	OFFSET	`1,3`
	FORMULA	`Conjecture: for n>100, sum(k=1, n, a(k)) > n^(3/2)`
	PROGRAM	`(PARI) a(n)=sum(i=1, n, if((n^i-1)%i, 0, 1))`
	CROSSREFS	`Adjacent sequences: A073020 A073021 A073022 this_sequence A073024 A073025 A073026` `Sequence in context: A018892 A100565 A010846 this_sequence A007012 A062830 A115119`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 21 2002`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research