The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A258438 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A258438

Sum_{i=1..n} Sum_{j=1..n} (i OR j), where OR is the binary logical OR operator.
(history; published version)

#31 by Michael De Vlieger at Fri Nov 04 07:31:45 EDT 2022

STATUS

reviewed

approved

#30 by Michel Marcus at Fri Nov 04 01:03:40 EDT 2022

STATUS

proposed

reviewed

#29 by Michael De Vlieger at Thu Nov 03 22:55:20 EDT 2022

STATUS

editing

proposed

#28 by Michael De Vlieger at Thu Nov 03 22:55:18 EDT 2022

LINKS

Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, <a href="https://arxiv.org/abs/2210.10968">Identities and periodic oscillations of divide-and-conquer recurrences splitting at half</a>, arXiv:2210.10968 [cs.DS], 2022, p. 42.

STATUS

approved

editing

#27 by Bruno Berselli at Thu Jun 18 06:06:44 EDT 2015

STATUS

editing

approved

#26 by Bruno Berselli at Thu Jun 18 06:04:11 EDT 2015

FORMULA

a((2^k)-1) = (2^(k-2)) * (4 - 7*2^k + 3*4^k)). - Enrique Pérez Herrero, Jun 10 2015

STATUS

proposed

editing

#25 by Robert Israel at Thu Jun 11 17:25:41 EDT 2015

STATUS

editing

proposed

#24 by Robert Israel at Thu Jun 11 17:25:12 EDT 2015

FORMULA

a(n) = n^3 + n^2 - A224924(n). - Robert Israel, Jun 11 2015

STATUS

proposed

editing

#23 by Robert Israel at Thu Jun 11 17:19:20 EDT 2015

STATUS

editing

proposed

#22 by Robert Israel at Thu Jun 11 17:06:55 EDT 2015

MAPLE

A[0]:= 0:

for n from 1 to 100 do

A[n]:= A[n-1] + n + 2*add(Bits[Or](i, n), i=1..n-1)

od:

seq(A[i], i=0..100); # Robert Israel, Jun 11 2015

STATUS

proposed

editing