Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087270
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087270 Solutions to GCD[x,pi[x]]=GCD[x, A000720(x)]>1. Numbers x such that x and pi(x) have common divisor larger than one. +0
1
4, 6, 8, 10, 14, 15, 16, 20, 22, 24, 27, 30, 33, 38, 39, 40, 44, 46, 48, 50, 51, 54, 56, 58, 62, 63, 64, 66, 72, 75, 77, 78, 80, 82, 90, 92, 93, 94, 96, 100, 102, 105, 108, 114, 115, 116, 117, 118, 120, 122, 123, 124, 125, 126, 132, 134, 136, 138, 140, 142, 144, 146 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

t=Table[GCD[w, PrimePi[w]], {w, 1, 1000}]; Flatten[Position[Sign[t-1], 1]]

CROSSREFS

Cf. A007053, A000720, A087266-A087269, A057809.

Sequence in context: A087684 A084808 A031020 this_sequence A075124 A067315 A069148

Adjacent sequences: A087267 A087268 A087269 this_sequence A087271 A087272 A087273

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Sep 16 2003

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 20 13:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research