Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066952
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066952 Number of unordered primitive solutions of xy=n (i.e. GCD(x,y)=1). +0
1
1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 2, 1, 1, 3, 1, 3, 2, 2, 1, 2, 1, 2, 1, 3, 1, 4 (list; graph; listen)
OFFSET

1,6
CROSSREFS

Adjacent sequences: A066949 A066950 A066951 this_sequence A066953 A066954 A066955

Sequence in context: A002951 A093993 A123529 this_sequence A081707 A008480 A066882

KEYWORD

nonn,easy

AUTHOR

Colin Mallows (colinm(AT)research.avayalabs.com) Jan 26 2002

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 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.