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!)
A340298 a(n) = a(floor(n/2)) + a(ceiling(n/2)) + n*floor(log_2(n)) for n >= 2, a(n) = n for n <= 1. 2

%I #12 Jan 04 2021 17:54:53

%S 0,1,4,8,16,22,28,38,56,65,74,83,92,105,118,139,176,189,202,215,228,

%T 241,254,267,280,297,314,331,348,373,398,439,512,530,548,566,584,602,

%U 620,638,656,674,692,710,728,746,764,782,800,822,844,866,888,910,932,954

%N a(n) = a(floor(n/2)) + a(ceiling(n/2)) + n*floor(log_2(n)) for n >= 2, a(n) = n for n <= 1.

%H Alois P. Heinz, <a href="/A340298/b340298.txt">Table of n, a(n) for n = 0..10000</a>

%F a(2^n) = A340257(n).

%p a:= proc(n) option remember; `if`(n<2, n, (h->

%p a(h)+a(n-h)+n*ilog2(n))(iquo(n, 2)))

%p end:

%p seq(a(n), n=0..55);

%Y Cf. A033156, A340257, A340301.

%K nonn,look

%O 0,3

%A _Alois P. Heinz_, Jan 03 2021

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 May 5 08:57 EDT 2024. Contains 372264 sequences. (Running on oeis4.)