This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A254431 #30 Apr 17 2016 11:50:37 %S A254431 1,1,2,10,131,3887,262555,42240104,16821037273,17094916187012, %T A254431 45374905859155948 %N A254431 Number of "feasible" partitions of the smallest natural number of length n. %C A254431 The sequence lists the number of "feasible" partitions of the first natural number (3^(n-1)+1)/2 of length n. Here n resembles m in A254296 which describes "feasible" partitions. %H A254431 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 A254431 a(n) = A254296((3^(n-1)+1)/2). %e A254431 The smallest natural numbers "feasibly" partitionable into 1, 2, 3, 4 and 5 parts respectively are 1,2,5,14 and 41. From A254296, the number of "feasible" partitions of them are 1,1,2,10 and 131. %Y A254431 Cf. A254296, A254430, A254432, A254433, A254435, A254436, A254437, A254438, A254439, A254440, A254442. %K A254431 nonn,more %O A254431 1,3 %A A254431 _Md. Towhidul Islam_, Jan 30 2015 %E A254431 a(10)-a(11) from _Md. Towhidul Islam_, Apr 18 2015