Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039743
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039743 GCD(phi(a(n)),a(n)-1) = number of prime factors of a(n). +0
1
2, 4, 8, 15, 16, 32, 35, 39, 51, 55, 63, 64, 70, 75, 87, 95, 99, 111, 115, 119, 123, 128, 130, 135, 143, 147, 154, 155, 159, 171, 183, 187, 203, 207, 215, 219, 235, 238, 256, 267, 275, 279, 280, 287, 291, 295, 299, 303, 310, 319, 322, 323, 327, 335, 339, 351 (list; graph; listen)
OFFSET

1,1

EXAMPLE

phi(15)=8, gcd(8,14)=2, 15=3*5, 2 prime factors.

CROSSREFS

Cf. A000010, A001221.

Adjacent sequences: A039740 A039741 A039742 this_sequence A039744 A039745 A039746

Sequence in context: A078613 A072202 A076351 this_sequence A070008 A033623 A094398

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (ogerard(AT)ext.jussieu.fr)

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research