Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073762
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A073762
%S A073762 12,36,60,84,108,132,156,180,204,228,252,276,300,324,348,372,396,420,
%T A073762 444,468,492,516,540,564,588,612,636,660,684,708,732,756,780,804,828,
%U A073762 852,876,900,924,948,972,996
%N A073762 Smallest unrelated number belonging to a term of this sequence equals 
               8.
%H A073762 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A073762 Min{URS[m]}=8, where UNR[m]=Complement[RRS[m], Divisors[m]].
%F A073762 a(n) = 24n-12. - Max Alekseyev, Mar 03 2007
%e A073762 URSet[12]={8,9,10} so 12 is here.
%t A073762 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]]; Do[s=Min[unr[n]]; If[Equal[s, 8], Print[n]], 
               {n, 1, 1000}]
%Y A073762 Cf. A045763, A073758-A073761, A016825.
%Y A073762 Sequence in context: A039317 A063298 A055926 this_sequence A043140 A043920 
               A049598
%Y A073762 Adjacent sequences: A073759 A073760 A073761 this_sequence A073763 A073764 
               A073765
%K A073762 nonn
%O A073762 1,1
%A A073762 Labos E. (labos(AT)ana.sote.hu), Aug 08 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research