Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A009195
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A009195 GCD(n, phi(n)). +0
19
1, 1, 1, 2, 1, 2, 1, 4, 3, 2, 1, 4, 1, 2, 1, 8, 1, 6, 1, 4, 3, 2, 1, 8, 5, 2, 9, 4, 1, 2, 1, 16, 1, 2, 1, 12, 1, 2, 3, 8, 1, 6, 1, 4, 3, 2, 1, 16, 7, 10, 1, 4, 1, 18, 5, 8, 3, 2, 1, 4, 1, 2, 9, 32, 1, 2, 1, 4, 1, 2, 1, 24, 1, 2, 5, 4, 1, 6, 1, 16, 27, 2, 1, 12, 1, 2, 1, 8, 1, 6, 1, 4, 3, 2, 1, 32, 1, 14, 3, 20 (list; graph; listen)
OFFSET

1,4

LINKS

T. D. Noe, Table of n, a(n) for n=1..10000

CROSSREFS

Cf. A000010, A003277, A050399. Also GCD[n, A051593[n]] (Labos E.).

Sequence in context: A135545 A123317 A164879 this_sequence A072994 A052126 A094521

Adjacent sequences: A009192 A009193 A009194 this_sequence A009196 A009197 A009198

KEYWORD

nonn,easy,nice

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research