Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082998
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082998 a(n) = card{ x <= n : omega(x) = 3 }. +0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 10 (list; graph; listen)
OFFSET

1,42

REFERENCES

G. Tenenbaum, Introduction a la theorie analytique et probabiliste des nombres, p. 203, Publications de l'Institut Cartan,1990.

FORMULA

a(n) ~ (1/2)*(n/log(n))*log(log(n))^2

PROGRAM

(PARI) a(n)=sum(i=1, n, if(omega(i)-3, 0, 1))

CROSSREFS

Cf. A025528, A072000.

Sequence in context: A105514 A062153 A135661 this_sequence A076620 A121900 A056811

Adjacent sequences: A082995 A082996 A082997 this_sequence A082999 A083000 A083001

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 30 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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research