login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #11 Jun 13 2019 20:49:28

%S 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,

%T 15,17,19,21,23,26,29,32,35,38,20,22,24,26,29,32,35,38,41,44,47,50,53,

%U 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

%N a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k = floor((n+1)/2), t = A023531.

%F a(n) = Sum_{k=1..floor((n+1)/2)} A023531(n+1-k). - _Sean A. Irvine_, Jun 11 2019

%t Array[Sum[k Boole@ IntegerQ@ Sqrt[8 # + 9] &[# + 1 - k], {k, Floor[(# + 1)/2]}] &, 82] (* _Michael De Vlieger_, Jun 12 2019 *)

%K nonn

%O 1,3

%A _Clark Kimberling_

%E Missing a(21)=10 inserted and title simplified by _Sean A. Irvine_, Jun 11 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 03:59 EDT 2024. Contains 371798 sequences. (Running on oeis4.)