Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124446
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124446 a(n) = GCD(A066840(n),A124440(n)). +0
4
1, 1, 1, 1, 1, 1, 3, 4, 1, 4, 5, 6, 3, 3, 2, 16, 4, 1, 9, 20, 6, 5, 11, 24, 1, 12, 1, 42, 7, 8, 15, 64, 10, 16, 6, 54, 9, 9, 6, 80, 10, 6, 21, 110, 2, 11, 23, 96, 3, 4, 8, 156, 13, 1, 10, 168, 18, 28, 29, 120, 15, 15, 6, 256, 24, 10, 33, 272, 22, 24, 35, 216, 18, 36, 2, 342, 30, 24, 39 (list; graph; listen)
OFFSET

1,7

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

Those positive integers which are coprime to 8 and are <= 8/2, are 1 and 3. Those integers which are coprime to 8 and are between 8/2 and 8, are 5 and 7.

So a(8) = GCD(1+3,5+7) = GCD(4,12) = 4.

MATHEMATICA

f1[n_] := Plus @@ Select[Range[Floor[n/2]], GCD[ #, n] == 1 &]; f2[n_] := Plus @@ Select[Range[Ceiling[n/2], n], GCD[ #, n] == 1 &]; Table[GCD[f1[n], f2[n]], {n, 80}] (*Chandler*)

CROSSREFS

Cf. A066840, A124440, A124447.

Sequence in context: A087694 A010262 A105579 this_sequence A091542 A079529 A133779

Adjacent sequences: A124443 A124444 A124445 this_sequence A124447 A124448 A124449

KEYWORD

nonn

AUTHOR

Leroy Quet Nov 01 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 12 2006

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