|
%I #17 Jun 07 2016 05:10:27
%S 1,1,1,6,1,3,4,2,6,1,7,4,4,9,1,10,4,8,9,3,14,2,12,9,7,34,7,11,16,4,20,
%T 5,17,14,8,24,1,23,12,14,23,3,28,8,20,21,9,30,4,28,17,15,32,2,34,13,
%U 23,28,8,38,7,31,24,16,40,1,41,18,24,37,7
%N a(n) is the length of the n-th run of A273190.
%H Chai Wah Wu, <a href="/A273191/b273191.txt">Table of n, a(n) for n = 1..10000</a>
%t Length /@ Split@ Table[Count[Range[0, n - 1], m_ /; IntegerQ@ Sqrt[m + n]], {n, 0, 10^3}] (* _Michael De Vlieger_, May 24 2016 *)
%o (Haskell)
%o import Data.List (group)
%o a273191 n = a273191_list !! (n - 1)
%o a273191_list = (map length . group) $ map a273190 [0..]
%o -- _Peter Kagey_, Jun 07 2016
%Y Cf. A273190.
%K easy,nonn,look
%O 1,4
%A _Alec Jones_, May 17 2016
|
