login
T
h
e
O
E
I
S
i
s
s
u
p
p
o
r
t
e
d
b
y
t
h
e
m
a
n
y
g
e
n
e
r
o
u
s
d
o
n
o
r
s
t
o
t
h
e
O
E
I
S
F
o
u
n
d
a
t
i
o
n
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!
)
A070177
Number of partitions of 10^n.
14
1, 42, 190569292, 24061467864032622473692149727991, 36167251325636293988820471890953695495016030339315650422081868605887952568754066420592310556052906916435144
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
0,2
COMMENTS
The next term a(
5
)=~2.749351*10^346 is too large to include.
Johansson computes the terms up to a(
19
). -
Charles R Greathouse IV
, Jul 09 2012
LINKS
Robert G. Wilson v,
Table of n, a(
n
) for n = 0..7
Fredrik Johansson,
Efficient implementation of the Hardy-Ramanujan-Rademacher formula
, arXiv:1205.5991 [math.NT], 2012, preprint;
DOI
, LMS J. Comput. Math. 15 (2012) 341-359.
Eric Weisstein's World of Mathematics,
Partition Function P
FORMULA
a(
n
) =
A000041
(
A011557
(
n
)). -
Michel Marcus
, Sep 29 2020
MATHEMATICA
Table[ PartitionsP[10^n], {n, 0, 4}] (*
Robert G. Wilson v
, Nov 14 2005 *)
PROG
(PARI) a(
n
) = numbpart(10^n); \\
Michel Marcus
, Oct 03 2014
CROSSREFS
Cf.
A000041
,
A011557
.
Sequence in context:
A364220
A152508
A238637
*
A173866
A291871
A357001
Adjacent sequences:
A070174
A070175
A070176
*
A070178
A070179
A070180
KEYWORD
nonn
AUTHOR
Eric W. Weisstein
, Apr 24 2002
EXTENSIONS
More terms from
Vladeta Jovovic
, May 03 2002
STATUS
approved
L
o
o
k
u
p
|
W
e
l
c
o
m
e
|
W
i
k
i
|
R
e
g
i
s
t
e
r
|
M
u
s
i
c
|
P
l
o
t
2
|
D
e
m
o
s
|
I
n
d
e
x
|
B
r
o
w
s
e
|
M
o
r
e
|
W
e
b
C
a
m
C
o
n
t
r
i
b
u
t
e
n
e
w
s
e
q
.
o
r
c
o
m
m
e
n
t
|
F
o
r
m
a
t
|
S
t
y
l
e
S
h
e
e
t
|
T
r
a
n
s
f
o
r
m
s
|
S
u
p
e
r
s
e
e
k
e
r
|
R
e
c
e
n
t
s
T
h
e
O
E
I
S
C
o
m
m
u
n
i
t
y
|
M
a
i
n
t
a
i
n
e
d
b
y
T
h
e
O
E
I
S
F
o
u
n
d
a
t
i
o
n
I
n
c
.
L
i
c
e
n
s
e
A
g
r
e
e
m
e
n
t
s
,
T
e
r
m
s
o
f
U
s
e
,
P
r
i
v
a
c
y
P
o
l
i
c
y
.
.
L
a
s
t
m
o
d
i
f
i
e
d
J
u
l
y
1
8
2
1
:
0
2
E
D
T
2
0
2
4
.
C
o
n
t
a
i
n
s
3
7
4
3
8
8
s
e
q
u
e
n
c
e
s
.
(
R
u
n
n
i
n
g
o
n
o
e
i
s
4
.
)
