The On-Line Encyclopedia of Integer Sequences (OEIS)

Revisions by Sela Fried (See also Sela Fried's wiki page)

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

A112884

Number of bits required to represent binomial(2^n, 2^(n-1)).
(history; published version)

#18 by Sela Fried at Thu Oct 03 16:25:54 EDT 2024

STATUS

editing

proposed

#17 by Sela Fried at Thu Oct 03 16:25:50 EDT 2024

COMMENTS

The conjectured formula 2^n - floor(n / 2) is true (see links). - Sela Fried, Oct 03 2024.

LINKS

Sela Fried, <a href="/A112884/a112884.pdf">The number of bits required to represent binomial(2^n, 2^(n-1))</a>, 2024.

STATUS

approved

editing

A119574

a(n) = binomial(2*n,n)*(n+2)^2/(n+1).
(history; published version)

#10 by Sela Fried at Wed Oct 02 14:32:28 EDT 2024

STATUS

editing

proposed

#9 by Sela Fried at Wed Oct 02 14:32:21 EDT 2024

COMMENTS

2 Sqrt[1 - 4 x] x (-1 + 4 x))). - Harvey P. Dale, Jun 02 2024.

The conjecture is true (see links). - Sela Fried, Oct 02 2024.

LINKS

Sela Fried, <a href="/A119574/a119574.pdf">On the generating function of A119574</a>, 2024.

STATUS

approved

editing

A136269

Floor of sum of the first 10^n cube roots.
(history; published version)

#6 by Sela Fried at Wed Oct 02 07:07:41 EDT 2024

STATUS

editing

proposed

#5 by Sela Fried at Wed Oct 02 07:07:37 EDT 2024

LINKS

Sela Fried, <a href="/A136269/a136269.pdf">On the partial sums of Sum_{n=1..infinity}^\infty n^s for 0 < s <1$</a>

STATUS

proposed

editing

#4 by Sela Fried at Wed Oct 02 07:02:07 EDT 2024

STATUS

editing

proposed

#3 by Sela Fried at Wed Oct 02 07:02:03 EDT 2024

DATA

1, 16, 350, 7504, 161593, 3481214, 75000049, 1615826124, 34811916483, 750000000499, 16158260176316, 348119162523278, 7500000000004999, 161582601752402051, 3481191625209607376, 75000000000000049999, 1615826017523912899040, 34811916252095841925154

COMMENTS

The conjecture is true (see links) - Sela Fried, Oct 02 2024.

LINKS

Sela Fried, <a href="/A136269/a136269.pdf">On the partial sums of Sum_{n=1}^\infty n^s for 0 < s <1$</a>

STATUS

approved

editing

A132344

a(n) = n*2^(floor(n/2)).
(history; published version)

#22 by Sela Fried at Fri Aug 30 15:40:39 EDT 2024

STATUS

editing

proposed

#21 by Sela Fried at Fri Aug 30 15:39:50 EDT 2024

COMMENTS

This sequence is related to a greedily and recursively defined sequence (see links) - Sela Fried, Aug 30 2024.

LINKS

Sela Fried, <a href="/A132344/a132344.pdf">On integer sequence A128135</a>, 2024.

STATUS

approved

editing