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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077644 Number of decimal digits of A070177(n). 6
1, 2, 9, 32, 107, 347, 1108, 3515, 11132, 35219, 111391, 352269, 1113996, 3522791, 11140072, 35228031, 111400846, 352280442, 1114008610, 3522804578, 11140086260 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
Richard P. Stanley, Enumerative Combinatorics, Cambridge University Press, April 1997, p. 79.
LINKS
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy] p. 825.
Fredrik Johansson, Efficient implementation of the Hardy-Ramanujan-Rademacher formula, 2012 preprint, to be published in LMS Journal of Computation and Mathematics.
FORMULA
a(n) = (Pi*sqrt(2/3)*sqrt(10)^n-log(48)/2-n*log(10))/log(10) + O(1). - Charles R Greathouse IV, Jul 10 2012
EXAMPLE
p(10^3) = 24061467864032622473692149727991 has 32 decimal digits, so a(3) = 32.
MATHEMATICA
f[n_] := Floor[ Log[10, PartitionsP[10^n]] + 1]; Array[f, 13, 0]
PROG
(PARI) a(n)=#Str(numbpart(10^n)) \\ Charles R Greathouse IV, Jul 09 2012
CROSSREFS
Cf. A070177.
Sequence in context: A332870 A074084 A053152 * A292482 A053369 A076959
KEYWORD
nonn,base,more
AUTHOR
Labos Elemer, Nov 15 2002
EXTENSIONS
a(0), a(10)-a(12), a(15)=35228031 from Robert G. Wilson v, Jun 08 2010
a(13)-a(19) from Charles R Greathouse IV, Jul 09 2012 based on Johansson 2012
a(20) from Robert G. Wilson v, Mar 02 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 11:35 EDT 2024. Contains 371838 sequences. (Running on oeis4.)