id:A094593 - OEIS Search Results

Search: id:A094593

Displaying 1-1 of 1 results found.

page 1

Let p = n-th prime; then a(n) = (p-1)/x, where p = prime(n) and x = ord(3,p), the smallest positive integer such that 3^x == 1 mod p.

+0
1

1, 1, 2, 4, 1, 1, 2, 1, 1, 2, 5, 1, 2, 1, 2, 6, 3, 2, 6, 1, 2, 1, 2, 1, 3, 2, 4, 1, 1, 2, 1, 1, 1, 3, 2, 1, 2, 1, 2, 4, 2, 12, 1, 1, 1, 1, 2, 4, 1, 2, 2, 2, 1, 2, 1, 9, 4, 1, 1, 1, 9, 2, 8, 1, 1, 2, 2, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 2, 2, 4, 10, 16, 3, 2, 1, 2, 1, 1, 2, 2, 1, 10, 3, 2, 1, 1, 9, 4, 39, 1, 2, 1, 1 (list; graph; listen)

	OFFSET	`3,3`
	FORMULA	`a(n)=(A000040(n)-1)/A062117(n)`
	PROGRAM	`(PARI) a(n)=(prime(n)-1)/if(n<0, 0, k=1; while((3^k-1)%prime(n)>0, k++); k)`
	CROSSREFS	`Cf. A001917.` `Sequence in context: A099803 A010741 A094643 this_sequence A007738 A158570 A074749` `Adjacent sequences: A094590 A094591 A094592 this_sequence A094594 A094595 A094596`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 06 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research