|
Search: id:A073760
|
|
|
| A073760 |
|
Smallest unrelated number belonging to a term of this sequence equals four. |
|
+0
2
|
|
| 6, 10, 14, 18, 22, 26, 30, 34, 38, 42, 46, 50, 54, 58, 62, 66, 70, 74, 78, 82, 86, 90, 94, 98, 102, 106, 110, 114, 118, 122, 126, 130, 134, 138, 142, 146, 150, 154, 158, 162, 166, 170, 174, 178, 182, 186, 190, 194, 198, 202, 206, 210, 214, 218, 222, 226, 230
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Essentially the same as A016825.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
Min{URS[m]}=4, where UNR[m]=Complement[RRS[m], Divisors[m]].
a(n) = 4n+2. - Max Alekseyev, Mar 03 2007
a(n)=8*n-a(n-1), (with a(1)=6) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Oct 18 2009]
|
|
EXAMPLE
|
For n=2, a(2)=8*2-6=10; n=3, a(3)=8*3-10=14; n=4, a(4)=8*4-14=18 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Oct 18 2009]
|
|
MATHEMATICA
|
tn[x_] := Table[w, {w, 1, x}]; di[x_] := Divisors[x]; dr[x_] := Union[di[x], rrs[x]]; rrs[x_] := Flatten[Position[GCD[tn[x], x], 1]]; unr[x_] := Complement[tn[x], dr[x]]; tn[x_] := Table[w, {w, 1, x}] di[x_] := Divisors[x] dr[x_] := Union[di[x], rrs[x]] rrs[x_] := Flatten[Position[GCD[tn[x], x], 1]] nr[x_] := Complement[tn[x], rrs[x]] nd[x_] := Complement[tn[x], di[x]] unr[x_] := Complement[tn[x], dr[x]] Do[s=Min[unr[n]]; If[Equal[s, 4], Print[n]], {n, 1, 1000}]
|
|
CROSSREFS
|
Cf. A045763, A073758, A073759, A016825.
Sequence in context: A091577 A115036 A133653 this_sequence A136767 A007944 A006617
Adjacent sequences: A073757 A073758 A073759 this_sequence A073761 A073762 A073763
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Aug 08 2002
|
|
|
Search completed in 0.002 seconds
|
