id:A072860 - OEIS Search Results

Search: id:A072860

Displaying 1-1 of 1 results found.

page 1

Highest power of 3 dividing the period length of 1/prime(n) = A002371(n).

+0
1

0, 1, 0, 3, 1, 3, 1, 9, 1, 1, 3, 3, 1, 3, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 27, 1, 3, 1, 1, 1, 1, 3, 3, 81, 1, 1, 1, 9, 1, 3, 1, 9, 3, 3, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 1, 9, 1, 3, 1, 1, 3, 1, 1, 1, 1, 3, 3, 27, 1, 1, 9, 1, 3, 1, 1, 1, 27, 3, 1, 1, 1, 1, 1, 1, 1, 243, 1, 3, 1, 1, 1, 9, 27 (list; graph; listen)

	OFFSET	`1,4`
	PROGRAM	`(PARI) for n>3 ? a(n)=if(n<4, n==2, znorder(Mod(10, prime(n)))) ? for(n=4, 150, print1(gcd(a(n), 3^100), ", "))`
	CROSSREFS	`Cf. A002371.` `Sequence in context: A122410 A082495 A016572 this_sequence A068503 A073575 A146431` `Adjacent sequences: A072857 A072858 A072859 this_sequence A072861 A072862 A072863`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 26 2002`

page 1

Search completed in 0.002 seconds

Last modified December 1 13:23 EST 2009. Contains 167758 sequences.

AT&T Labs Research