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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060262 a(n) is the smallest x such that p(x), p(x+1), ..., p(x+n-1) all have 10 as a primitive root, but p(x-1) and p(x+n) do not, where p(n)=A000040(n) is the n-th prime. 3
4, 17, 55, 7, 93, 754, 2611, 31092, 55207, 301252, 955428, 805428 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

A prime p has 10 as a primitive root iff the length of the period of the decimal expansion of 1/p is p-1.

MATHEMATICA

test[p_] := MultiplicativeOrder[10, p]===p-1; For[n=1, n<100, n++, a[n]=0]; v=4; While[True, For[n=1, test[Prime[v+n]], n++, Null]; If[a[n]==0, a[n]=v; Print["a(", n, ") = ", v]]; For[v+=n+1, !test[Prime[v]], v++, Null]]

CROSSREFS

Cf. A001913, A002371, A060259, A060260, A060261.

Sequence in context: A092091 A046995 A001585 * A157492 A108140 A121327

Adjacent sequences:  A060259 A060260 A060261 * A060263 A060264 A060265

KEYWORD

nonn,more

AUTHOR

Jeff Burch (gburch(AT)erols.com), Mar 23 2001

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jun 17 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 14 08:23 EST 2012. Contains 205613 sequences.