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!)
A301768 Number of ways to choose a strict rooted partition of each part in a constant rooted partition of n. 1

%I #4 Mar 26 2018 20:03:59

%S 1,1,2,2,4,3,6,5,11,8,14,11,32,16,36,32,70,33,104,47,168,130,178,90,

%T 521,155,369,383,902,223,1562,297,1952,1392,1474,1665,6297,669,2878,

%U 4241,12401,1114,17474,1427,19436,20754,9971,2305,80110,19295,51942,36428

%N Number of ways to choose a strict rooted partition of each part in a constant rooted partition of n.

%C A rooted partition of n is an integer partition of n - 1.

%e The a(9) = 11 rooted twice-partitions:

%e (7), (61), (52), (43), (421),

%e (3)(3), (3)(21), (21)(3), (21)(21),

%e (1)(1)(1)(1),

%e ()()()()()()()().

%t Table[Sum[PartitionsQ[n/d-1]^d,{d,Divisors[n]}],{n,50}]

%Y Cf. A002865, A063834, A093637, A127524, A279788, A296132, A301422, A301462, A301467, A301480, A301706.

%K nonn

%O 1,3

%A _Gus Wiseman_, Mar 26 2018

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 25 09:56 EDT 2024. Contains 371967 sequences. (Running on oeis4.)