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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070971 a(n) is the smallest positive integer m for which A070194(m) (i.e. the maximal gap in {k|gcd(k,m)=1,1<=k<=m-1}) is n. 3
3, 4, 15, 6, 105, 30, 1155, 770, 36465, 210, 15015, 6006, 255255, 2310, 8580495, 102102, 4849845, 72930 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a[n] = least x such that maximal gap in RRS of x equals n: a[n]=Max{x: A070194[x]=n}

a(13) has not yet been found and is greater than 141600. Other known values with a(n)<=141600 are: a(14)=2310, a(16)=102102, a(18)=72930 and a(22)=30030.

For n>2, same as A128759, which gives the least k such that the Jacobsthal function A048669(k) equals n. See A128759 for more comments. - T. D. Noe (noe(AT)sspectra.com), Mar 28 2007

EXAMPLE

A070194 begins with 1,2,1,4,... with offset 3, so a(4)=6.

MATHEMATICA

gw[x_] := Table[GCD[w, x], {w, 1, x}] rrs[x_] := Flatten[Position[gw[x], 1]] dr[x_] := Delete[RotateLeft[rrs[x]]-rrs[x], -1] t=Table[0, {25}]; Do[s=Max[dr[n]]; If[s<26&&t[[s]]==0, t[[s]]=n], {n, 3, 10000}]; t - Labos E. (labos(AT)ana.sote.hu), Oct 09 2002

CROSSREFS

Cf. A000010, A070194, A071194, A061498.

Sequence in context: A194924 A205489 A076365 * A130113 A004735 A066830

Adjacent sequences:  A070968 A070969 A070970 * A070972 A070973 A070974

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), May 17 2002

EXTENSIONS

More terms from T. D. Noe (noe(AT)sspectra.com), Mar 28 2007

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 15 05:45 EST 2012. Contains 205694 sequences.