The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A318246 a(n) = [x^n] Product_{k>=1} (1 + 3^n*x^k). 2
 1, 3, 9, 756, 6642, 118341, 388484100, 10474704297, 564988219686, 22878342156600, 12158489037532504050, 984798697643349485688, 159533936817604246934415, 19383278088136495245171156, 2616739259326831261950662430, 608267042060342812170824926328855679 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Conjecture: In general, if m > 1 and a(n) = [x^n] Product_{k>=1} (1 + m^n * x^k), then log(a(n)) ~ log(m)*(sqrt(2)*n^(3/2) - n/2). LINKS Vaclav Kotesovec, Table of n, a(n) for n = 0..135 FORMULA Conjecture: log(a(n)) ~ log(3)*sqrt(2)*n^(3/2). MATHEMATICA nmax = 20; Table[SeriesCoefficient[Product[(1+3^n*x^k), {k, 1, n}], {x, 0, n}], {n, 0, nmax}] CROSSREFS Cf. A292414. Sequence in context: A137036 A088031 A069028 * A137043 A112726 A112725 Adjacent sequences: A318243 A318244 A318245 * A318247 A318248 A318249 KEYWORD nonn AUTHOR Vaclav Kotesovec, Aug 22 2018 STATUS approved

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

Last modified December 8 23:48 EST 2022. Contains 358698 sequences. (Running on oeis4.)