Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076362
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076362 Smallest x such that A061498[x]=n: least number in dRRS of which n distinct term occur. +0
1
1, 3, 9, 15, 385, 105, 3003, 1155 (list; graph; listen)
OFFSET

0,2

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}. Is this a rule that in each dRRS[a{(n)], distinct differences are {1,2,...,n}?

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.

Adjacent sequences: A076359 A076360 A076361 this_sequence A076363 A076364 A076365

Sequence in context: A083556 A015664 A134137 this_sequence A070066 A020967 A109340

KEYWORD

more,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 09 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 5 16:50 EDT 2008. Contains 144613 sequences.


AT&T Labs Research