login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076362 Smallest x such that A061498(x)=n: least number in dRRS of which n distinct term occur. 1
1, 3, 9, 15, 385, 105, 3003, 1155, 51051, 36465, 15015, 692835, 440895, 255255, 10140585, 8580495, 4849845 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Is it a rule that in each dRRS[a{(n)], distinct differences are {1,2,...,n}?

No more terms up to 2*10^5. - Michel Marcus, Mar 26 2020

a(17) > 2.4*10^7. a(18) <= 248834355, a(19) <= 190285095, a(20) <= 111546435. - Giovanni Resta, Apr 13 2020

LINKS

Table of n, a(n) for n=0..16.

FORMULA

a(n) = Min{x; A061498(x)=n}.

EXAMPLE

n=5, a(5)=105 because in dRRS[105]={1,2,4,3,2,....,1,5,...,2,1} five distinct terms[=consecutive residue-differences] occur, namely: {1,2,3,4,5}.

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] did[x_] := Length[Union[dr[x]]] t=Table[0, {25}]; Do[s=did[n]; If[s<258&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t

CROSSREFS

Cf. A061498, A000010.

Sequence in context: A272621 A134137 A174179 * A336970 A070066 A299636

Adjacent sequences:  A076359 A076360 A076361 * A076363 A076364 A076365

KEYWORD

nonn,more

AUTHOR

Labos Elemer, Oct 09 2002

EXTENSIONS

a(8)-a(10) from Michel Marcus, Mar 25 2020

a(11)-a(16) from Giovanni Resta, Apr 13 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 21:38 EDT 2021. Contains 348034 sequences. (Running on oeis4.)