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!)
A023869 a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t is A014306. 0

%I #7 Jun 12 2019 19:15:59

%S 0,1,3,2,4,3,6,10,15,14,19,18,24,23,30,29,37,36,45,54,64,63,74,73,85,

%T 84,97,96,110,109,124,123,139,138,154,152,169,167,185,204,224,223,244,

%U 243,265,264,287,286,310,309,334,333,359,358,385,383,410,408,436,434,463,461,491,489

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

%K nonn

%O 1,3

%A _Clark Kimberling_

%E Title simplified by _Sean A. Irvine_, Jun 12 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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)