The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A254430 Number of "feasible" partitions with n parts. 10

%I

%S 1,3,16,183,4804,299558,45834625,17696744699,17644374475261,

%T 46279884666882734,324101360547203133793

%N Number of "feasible" partitions with n parts.

%C This sequence answers the question: "How many sellers can each be provided with a distinct set of n-part 'feasible' weights described in A254296?" It counts all the n-part "feasible" partitions of all the natural numbers from (3^(n-1)+1)/2 to (3^n-1)/2. Here n resembles m in A254296.

%H Md Towhidul Islam & Md Shahidul Islam, <a href="http://arxiv.org/abs/1502.07730">Number of Partitions of an n-kilogram Stone into Minimum Number of Weights to Weigh All Integral Weights from 1 to n kg(s) on a Two-pan Balance</a>, arXiv:1502.07730 [math.CO], 2015.

%F a(n) = Sum_{p=(3^(n-1)+1)/2..(3^n-1)/2} A254296(p).

%e For n=2, we count 2nd through 4th values of A254296. So a(2)=1+1+1=3.

%e For n=3, we count 5th through 13th values from A254296. So a(3)= 2+2+3+2+2+2+1+1+1 = 16.

%e For n=4, a(4)= Sum of 14th through 40th terms of A254296, that is, 183.

%t okQ[v_] := Module[{s = 0}, For[i = 1, i <= Length[v], i++, If[v[[i]] > 2s + 1, Return[False], s += v[[i]]]]; Return[True]];

%t a254296[n_] := With[{k = Ceiling[Log[3, 2n]]}, Select[Reverse /@ IntegerPartitions[n, {k}], okQ] // Length];

%t a[n_] := Sum[a254296[p], {p, (3^(n-1) + 1)/2, (3^n - 1)/2}];

%t Array[a, 5] (* _Jean-François Alcover_, Nov 04 2018, after _Charles R Greathouse IV_ in A254296 *)

%Y Cf. A254296, A254431, A254432, A254433, A254435, A254436, A254437, A254438, A254439, A254440, A254442.

%K nonn

%O 1,2

%A _Md. Towhidul Islam_, Jan 30 2015

%E a(9)-a(11) from _Md. Towhidul Islam_, Apr 18 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 8 05:50 EDT 2020. Contains 336290 sequences. (Running on oeis4.)