|
| |
|
|
A050811
|
|
Partition numbers rounded to nearest integer given by the Hardy-Ramanujan approximate formula.
|
|
0
| |
|
|
2, 3, 4, 6, 9, 13, 18, 26, 35, 48, 65, 87, 115, 152, 199, 258, 333, 427, 545, 692, 875, 1102, 1381, 1725, 2145, 2659, 3285, 4046, 4967, 6080, 7423, 9037, 10974, 13293, 16065, 19370, 23304, 27977, 33519, 40080, 47833, 56981, 67757, 80431, 95316
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The mounting error seems to be approximately A035949(n-3), n>=4. - Alonso del Arte, Jul 28 2011
|
|
|
LINKS
| Dr. Math, Partitioning the Integers
Dr. Math, Partitioning an Integer
D. Rusin, Additive Partitions of Number
F. Ruskey, Generate Numerical Partitions
Eric Weisstein's World of Mathematics, Partition Function P
OEIS Wiki, Partition function
|
|
|
FORMULA
| a(n) = round(exp(Pi*sqrt(2*n/3))/(4*n*sqrt(3))). - Alonso del Arte, May 21 2011
|
|
|
MATHEMATICA
| Table[Round[(1/Sqrt[3]4n)) E^(Sqrt[2n/3]Pi)], {n, 50}] (*Alonso del Arte, May 21 2011 *)
|
|
|
PROG
| (Ubasic) input N:print round(#e^(pi(1)*sqrt(2*N/3))/(4*N*sqrt(3)))
|
|
|
CROSSREFS
| Cf. A000041, A049575, A051143.
Sequence in context: A129632 A016028 A098578 * A076968 A098889 A061481
Adjacent sequences: A050808 A050809 A050810 * A050812 A050813 A050814
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Patrick De Geest (pdg(AT)worldofnumbers.com), Oct 15 1999.
|
|
|
EXTENSIONS
| a(1)=1 replaced by 2, a(2)=2 replaced by 3. - A. del Arte, D. S. McNeil, Aug 07 2011
|
| |
|
|
