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!)
A274108 Number of partitions of n into parts with exactly two different sizes, the sizes being relatively prime. 3

%I #22 Aug 17 2022 10:26:16

%S 0,0,1,2,5,5,11,11,16,17,27,21,37,33,38,42,59,46,71,57,70,75,97,72,

%T 104,99,109,103,141,102,157,133,148,153,166,140,207,183,192,174,241,

%U 180,259,215,223,247,295,219,300,260,292,279,353,275,336,300,346,351

%N Number of partitions of n into parts with exactly two different sizes, the sizes being relatively prime.

%H Alois P. Heinz, <a href="/A274108/b274108.txt">Table of n, a(n) for n = 1..10000</a>

%H N. Benyahia Tani, S. Bouroubi, and O. Kihel, <a href="https://liforce.usthb.dz/sites/default/files/2020-11/article3.pdf">An effective approach for integer partitions using exactly two distinct sizes of parts</a>, Bulletin du Laboratoire 03 (2015), 18-27.

%e Explanation of a(3)-a(6):

%e n=3: 21

%e n=4: 31, 211

%e n=5: 41, 32, 311, 221, 2111

%e n=6: 51, 411, 3111, 2211, 21111

%Y Row sums of triangle in A274109.

%Y Cf. A002133, A117955, A117956, A216665.

%K nonn,look

%O 1,4

%A _N. J. A. Sloane_, Jun 17 2016

%E More terms from _Alois P. Heinz_, Jun 23 2016

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 September 16 04:06 EDT 2024. Contains 375959 sequences. (Running on oeis4.)