Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087267
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087267 a(n)=GCD[n,pi[n]]=GCD[n, A000720(n)]. +0
2
1, 1, 1, 2, 1, 3, 1, 4, 1, 2, 1, 1, 1, 2, 3, 2, 1, 1, 1, 4, 1, 2, 1, 3, 1, 1, 9, 1, 1, 10, 1, 1, 11, 1, 1, 1, 1, 2, 3, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 5, 3, 1, 1, 2, 1, 8, 1, 2, 1, 1, 1, 2, 9, 2, 1, 6, 1, 1, 1, 1, 1, 4, 1, 1, 3, 1, 7, 3, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 6, 1, 4, 3, 2, 1, 24, 1, 1, 1, 25, 1, 2, 1 (list; graph; listen)
OFFSET

1,4

MATHEMATICA

Table[GCD[w, PrimePi[w]], {w, 1, 256}]

CROSSREFS

Cf. A007053, A000720, A087266, A057809.

Sequence in context: A114897 A123539 A102547 this_sequence A128267 A028920 A055396

Adjacent sequences: A087264 A087265 A087266 this_sequence A087268 A087269 A087270

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research