Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087266
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087266 a(n)=GCD[2^n,pi[2^n]]=GCD[A000079, A007053]. +0
6
1, 2, 4, 2, 1, 2, 1, 2, 1, 4, 1, 4, 4, 4, 8, 2, 1, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 1, 1, 2, 1, 1, 1, 4, 4, 2, 4, 4, 1, 1, 4, 2, 1, 1, 2, 2, 1, 8, 1 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A007053, A000720.

Sequence in context: A046858 A132823 A059317 this_sequence A160801 A079046 A079045

Adjacent sequences: A087263 A087264 A087265 this_sequence A087267 A087268 A087269

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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research