|
%I #15 Oct 26 2018 01:02:44
%S 1,2,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,2,1,1,1,2,1,1,1,1,1,3,1,1,2,1,1,
%T 1,1,2,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,
%U 1,1,1,1,1,1,3,1,1,1,1,1,3,1,1,2,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,2,2,1,1,2,1
%N The length of the n-th run of identical consecutive values in the sequence A000005, where A000005(k) is the number of divisors of k.
%H Jason Kimberley, <a href="/A131789/b131789.txt">Table of n, a(n) for n = 1..89415</a>
%e Runs in A000005: (1), (2,2), (3), (2), (4), (2), (4), (3), (4), (2), (6), (2), (4,4), (5), (2), (6), (2), (6), (4,4), (2), (8), (3), ...
%Y Cf. A000005, A131790.
%K nonn,easy
%O 1,2
%A _Leroy Quet_, Jul 15 2007
%E More terms from _Joshua Zucker_, Jul 18 2007
%E Name clarified by _Jason Kimberley_, Jul 18 2018
|
