cp's OEIS Frontend

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.

A234092 Limit of v(m,n) as m->oo, where v(m,n) is the number of distinct terms in the n-th partition of m in Mathematica (lexicographic) ordering of the partitions of m.

This page as a plain text file.
%I A234092 #10 Jan 18 2014 16:23:53
%S A234092 1,2,2,2,2,3,2,2,3,2,3,2,2,3,3,3,3,3,2,2,3,3,3,2,4,3,2,3,3,2,2,3,3,3,
%T A234092 3,4,3,3,3,4,3,3,3,3,2,2,3,3,3,3,4,3,2,4,3,4,3,3,3,4,4,3,2,3,3,3,2,2,
%U A234092 3,3,3,3,4,3,3,4,3,4,3,3,4,4,4,4,3,2
%N A234092 Limit of v(m,n) as m->oo, where v(m,n) is the number of distinct terms in the n-th partition of m in Mathematica (lexicographic) ordering of the partitions of m.
%C A234092 Limiting row of A115623.
%e A234092 In Mathematica ordering, the 9th partition of n >= 8 is [n-4,3,1].  Thus, v(n,9) = 3 for n all n >= 8, so a(n) = 3.
%t A234092 Table[Length[Union[IntegerPartitions[40][[k]]]], {k, 1, 150}]
%Y A234092 Cf. A115623.
%K A234092 nonn
%O A234092 1,2
%A A234092 _Clark Kimberling_, Dec 26 2013