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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A023858 a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k = floor((n+1)/2), t = A023531. 0
 0, 1, 2, 0, 1, 2, 3, 4, 6, 2, 3, 4, 5, 7, 9, 11, 13, 5, 6, 8, 10, 12, 14, 16, 18, 20, 23, 11, 13, 15, 17, 19, 21, 23, 26, 29, 32, 35, 38, 20, 22, 24, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 66, 70, 74, 78, 82, 50, 53, 56, 59, 62, 65, 68, 72, 76, 80, 84, 88, 92 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS FORMULA a(n) = Sum_{k=1..floor((n+1)/2)} A023531(n+1-k). - Sean A. Irvine, Jun 11 2019 MATHEMATICA Array[Sum[k Boole@ IntegerQ@ Sqrt[8 # + 9] &[# + 1 - k], {k, Floor[(# + 1)/2]}] &, 82] (* Michael De Vlieger, Jun 12 2019 *) CROSSREFS Sequence in context: A332663 A227179 A115218 * A011118 A304784 A131644 Adjacent sequences:  A023855 A023856 A023857 * A023859 A023860 A023861 KEYWORD nonn AUTHOR EXTENSIONS Missing a(21)=10 inserted and title simplified by Sean A. Irvine, Jun 11 2019 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 January 16 09:13 EST 2021. Contains 340204 sequences. (Running on oeis4.)