|
%I #14 Jun 13 2020 00:49:13
%S 0,1,2,1,3,2,1,3,2,4,2,1,3,3,4,4,4,2,1,3,3,2,4,3,2,4,3,4,2,1,3,3,3,4,
%T 3,4,4,4,5,4,4,4,4,2,1,3,3,3,2,4,3,3,4,4,4,5,3,5,2,4,5,4,4,4,4,2,1,3,
%U 3,3,3,4,3,3,4,4,3,2,4,5,5,5,5,4,4,5,4,5,4,4,5,3,4,4,4,2
%N Number of iterations of signature function required to get to [1] from partitions in Abramowitz and Stegun order.
%C The signature function takes a partition to the partition consisting of its repetition factors.
%H Robert Price, <a href="/A113787/b113787.txt">Table of n, a(n) for n = 1..9295</a> (first 25 rows).
%H M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
%e Partition 5 in A&S order is [1,2]. Applying the signature function to this repeatedly gives [1,2] -> [1^2] -> [2] -> [1], so a(5)=3.
%t sig[x_] := Length@NestWhileList[Last@Transpose@Tally@# &, x, # != {1} &, 1] - 1;
%t Table[sig /@ Sort[Reverse /@ IntegerPartitions[n]], {n, 9}] // Flatten (* _Robert Price_, Jun 12 2020 *)
%Y Cf. A115621, A115624, Sequence of first partitions with a(m)=n is A012257, with initial rows {1} and {2} in prepended. See A036036 for A&S partitions.
%K easy,nonn
%O 1,3
%A _Franklin T. Adams-Watters_, Jan 20 2006
|
