|
%I #5 May 30 2015 03:55:57
%S 0,1,1,1,3,3,3,3,3,5,5,5,5,5,5,5,8,8,8,8,8,8,8,8,8,10,10,10,10,10,10,
%T 10,10,10,10,10,14,14,14,14,14,14,14,14,14,14,14,14,14,16,16,16,16,16,
%U 16,16,16,16,16,16,16,16,16,16,20,20,20,20,20,20,20,20,20,20,20,20,20,20
%N Repeat A006218(n) 2n+1 times.
%H Reinhard Zumkeller, <a href="/A113215/b113215.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n)=sum{k=0..n, floor(sqrt(n)/(k+1))}.
%o (Haskell)
%o a113215 n = a113215_list !! n
%o a113215_list = concat $ zipWith take
%o [1, 3 ..] $ map (repeat . a006218) [0 ..]
%o -- _Reinhard Zumkeller_, May 30 2015
%Y Cf. A006218.
%K easy,nonn
%O 0,5
%A _Paul Barry_, Oct 18 2005
|
