cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A048195 Numbers k for which binomial(k, floor(k/2)) has fewer unitary than non-unitary divisors.

Original entry on oeis.org

10, 25, 26, 27, 28, 29, 30, 34, 36, 37, 38, 40, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 58, 60, 61, 62, 63, 64, 66, 68, 69, 70, 75, 76, 77, 78, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 108, 109, 110
Offset: 1

Views

Author

Keywords

Comments

A048111 applied to central binomial coefficients.

Examples

			k = 58: binomial(58,29) has 20480 divisors, 8192 unitary ones and 12288 non-unitary ones, and 8192 < 12288.
		

Crossrefs

Programs

  • Mathematica
    q[n_] := Module[{e = FactorInteger[Binomial[n, Floor[n/2]]][[;; , 2]]}, Times @@ (e + 1) > 2^(Length[e] + 1)]; Select[Range[120], q] (* Amiram Eldar, Oct 05 2024 *)
  • PARI
    nbud(n) = 1<A034444
    isok(n) = my(b=binomial(n, n\2)); numdiv(b) > 2*nbud(b); \\ Michel Marcus, Mar 15 2018

Formula

Extensions

More terms from Michel Marcus, Mar 15 2018