login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072860 Highest power of 3 dividing the period length of 1/prime(n) = A002371(n). 0
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; refs; listen; history; internal format)
OFFSET

1,4

PROG

(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: A082495 A200476 A016572 * A068503 A073575 A146431

Adjacent sequences:  A072857 A072858 A072859 * A072861 A072862 A072863

KEYWORD

base,easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 26 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 06:25 EST 2012. Contains 205996 sequences.