A162214 -id:A162214 - cp's OEIS frontend

A082482 a(n) = floor of (2^n-1)/n.

1, 1, 2, 3, 6, 10, 18, 31, 56, 102, 186, 341, 630, 1170, 2184, 4095, 7710, 14563, 27594, 52428, 99864, 190650, 364722, 699050, 1342177, 2581110, 4971026, 9586980, 18512790, 35791394, 69273666, 134217727, 260301048, 505290270, 981706810

Offset: 1

Jon Perry, Apr 27 2003

nonn

a(n) is the largest exponent k such that (2^n)^k || (2^n)!. - Lekraj Beedassy, Jan 15 2024

			a(3) = floor((2^3-1)/3) = floor(7/3) = floor(2.333) = 2.

Robert Israel, Table of n, a(n) for n = 1..3320

Cf. A023359, A082495, A162214.

a(n) = A053638(n) - 1.

seq(floor((2^n-1)/n), n=1..100); # Robert Israel, Dec 01 2016

for (n=1,50,print1(floor((2^n-1)/n)","))

a(n) = (2^n - 1 - A082495(n))/n = A162214(n)/n. - Robert Israel, Dec 01 2016

A162213 a(n) = the smallest positive multiple of n with exactly n digits when written in binary.

Original entry on oeis.org

1, 2, 6, 8, 20, 36, 70, 128, 261, 520, 1034, 2052, 4108, 8204, 16395, 32768, 65552, 131076, 262162, 524300, 1048593, 2097172, 4194326, 8388624, 16777225, 33554456, 67108878, 134217748, 268435484, 536870940, 1073741854, 2147483648

Offset: 1

Leroy Quet, Jun 28 2009

Alois P. Heinz, Table of n, a(n) for n = 1..1000

Cf. A162214, A053041.

a := proc (n) local k: for k while nops(convert(k*n, base, 2)) <> n do end do; k*n end proc: seq(a(n), n = 1 .. 24); # Emeric Deutsch, Jul 10 2009
a:= n-> n*ceil(2^(n-1)/n): seq(a(n), n=1..40); # Alois P. Heinz, Jul 11 2009

Array[# Ceiling[2^(# - 1)/#] &, 32] (* Michael De Vlieger, Nov 04 2017 *)

a(n) = n * ceiling(2^(n-1)/n). - Alois P. Heinz, Jul 11 2009

More terms from Emeric Deutsch and Alois P. Heinz, Jul 11 2009

cp's OEIS Frontend

A082482 a(n) = floor of (2^n-1)/n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

PARI

Formula