The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113215 Repeat A006218(n) 2n+1 times. 1
 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, 10, 10, 10, 10, 10, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 FORMULA a(n)=sum{k=0..n, floor(sqrt(n)/(k+1))}. PROG (Haskell) a113215 n = a113215_list !! n a113215_list = concat \$ zipWith take                         [1, 3 ..] \$ map (repeat . a006218) [0 ..] -- Reinhard Zumkeller, May 30 2015 CROSSREFS Cf. A006218. Sequence in context: A112593 A213809 A204854 * A105591 A130497 A178154 Adjacent sequences:  A113212 A113213 A113214 * A113216 A113217 A113218 KEYWORD easy,nonn AUTHOR Paul Barry, Oct 18 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 18 04:58 EDT 2021. Contains 343994 sequences. (Running on oeis4.)