This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236360 Numerator of the mean of all parts of all partitions of n. 2
 1, 4, 3, 5, 7, 66, 35, 88, 135, 35, 56, 44, 1313, 63, 220, 48, 1683, 3465, 4655, 1254, 4158, 7348, 28865, 2700, 48950, 10556, 13545, 14872, 132385, 168120, 212102, 89056, 111573, 209270, 520905, 323586, 800569, 988570, 1216215, 35560, 1827903, 744436 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The arithmetic mean, M(n), of all parts of all partitions of n can be approximated by n^e(n), as typified by these pairs: n ..... 100 .... 1000 .... 2000 .... 3000 .... 4000 .... 5000 e(n) .. 0.331 .. 0.3410 .. 0.3447 .. 0.3468 .. 0.3483 .. 0.3495 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..1000 FORMULA M(n) = A066186(n)/A006128(n). EXAMPLE First eight means:  1, 4/3, 3/2, 5/3, 7/4, 66/35, 35/18, 88/43. MAPLE b:= proc(n, i) option remember; `if`(n=0, [1, 0\$2],       `if`(i<1, [0\$3], b(n, i-1)+`if`(i>n, [0\$3],        (l-> l+[0, l[1]*i, l[1]])(b(n-i, i)))))     end: a:= n-> numer((l->l[2]/l[3])(b(n\$2))): seq(a(n), n=1..50);  # Alois P. Heinz, Feb 06 2014 MATHEMATICA f[n_] := Sum[DivisorSigma[0, m] PartitionsP[n - m], {m, 1, n}]; u =  PartitionsP[Range[50]] Range[50]; t = Table[u[[n]]/f[n], {n, 1, 50}] Numerator[t]    (*A236360*) Denominator[t]  (*A234361*) means = Map[Mean[Flatten[IntegerPartitions[#]]] &, Range[50]]; pwrLaw = a x^b; fit = FindFit[means, pwrLaw, {a, b}, x]; Show[{ListPlot[means], Plot[Function[{x}, Evaluate[pwrLaw /. fit]][x], {x, 1, Length[means]}]}] fit  (* Peter J. C. Moses, Jan 22 2014 *) CROSSREFS Cf. A006128, A066186, A236361. Sequence in context: A035427 A257120 A033546 * A299323 A010475 A256367 Adjacent sequences:  A236357 A236358 A236359 * A236361 A236362 A236363 KEYWORD nonn,frac,easy AUTHOR Clark Kimberling, Jan 24 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 17 22:28 EST 2018. Contains 317279 sequences. (Running on oeis4.)
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://oeis.org/A236360", "fetch_time": 1542513381000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2018-47/segments/1542039743963.32/warc/CC-MAIN-20181118031826-20181118053826-00272.warc.gz", "warc_record_offset": 699474121, "warc_record_length": 4312, "token_count": 909, "char_count": 2275, "score": 3.65625, "int_score": 4, "crawl": "CC-MAIN-2018-47", "snapshot_type": "latest", "language": "en", "language_score": 0.39610108733177185, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00050-of-00064.parquet"}