Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074946
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074946 Numbers n such that the equation gcd(n,x) = bigomega(n) has solutions 1<=x<=n. +0
2
2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 16, 17, 18, 19, 22, 23, 24, 26, 27, 29, 30, 31, 34, 36, 37, 38, 40, 41, 42, 43, 45, 46, 47, 53, 56, 58, 59, 60, 61, 62, 63, 66, 67, 71, 73, 74, 75, 78, 79, 80, 82, 83, 84, 86, 88, 89, 94, 96, 97, 99, 100, 101, 102, 103, 104, 105, 106 (list; graph; listen)
OFFSET

1,1

COMMENT

If n is prime, trivially n is in the sequence.

FORMULA

a(n) seems to be asymptotic to c*n*log(log(n)) with 1< c < 1.1

CROSSREFS

Sequence in context: A032879 A032846 A023777 this_sequence A050687 A098908 A131616

Adjacent sequences: A074943 A074944 A074945 this_sequence A074947 A074948 A074949

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 05 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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research