|
Search: id:A052488
|
|
|
| A052488 |
|
[n*H(n)] where H(n) is the n-th harmonic number (i.e. sum (1/k), k= 1...n). |
|
+0
3
|
|
| 1, 3, 5, 8, 11, 14, 18, 21, 25, 29, 33, 37, 41, 45, 49, 54, 58, 62, 67, 71, 76, 81, 85, 90, 95, 100, 105, 109, 114, 119, 124, 129, 134, 140, 145, 150, 155, 160, 165, 171, 176, 181, 187, 192, 197, 203, 208, 214, 219, 224, 230, 235, 241, 247, 252, 258, 263, 269
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
[n*H(n)] gives a (very) rough approximation to the n-th prime
a(n) is the integer part of the solution to the Coupon Collector's Problem. For example, if there are n=4 different prizes to collect from cereal boxes, and they are equally likely to be found, then the integer part of the average number of boxes to buy before the collection is complete is a(4)=8. - Ron Lalonde (ronronronlalonde(AT)hotmail.com), Feb 04 2004
|
|
MAPLE
|
for n from 1 to 100 do printf(`%d, `, floor(n*sum(1/k, k=1..n))) od:
|
|
CROSSREFS
|
Cf. A006218.
Sequence in context: A094228 A001855 A006591 this_sequence A076372 A005356 A060432
Adjacent sequences: A052485 A052486 A052487 this_sequence A052489 A052490 A052491
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Tomas Mario Kalmar (TomKalmar(AT)aol.com), Mar 15 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Mar 17 2000
|
|
|
Search completed in 0.002 seconds
|
