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.

A380803 a(n) is the least number k such that A380802(k) = n, or -1 if no such number exists.

Original entry on oeis.org

1, 2, 3, 4, 5, 53, 130, 212, 286, 563, 1215, 1279, 2835, 2434, 3930, 5011, 7031, 18217, 18692, 24218, 35317, 30986
Offset: 0

Views

Author

Amiram Eldar, Feb 04 2025

Keywords

Comments

a(23) = 80200, a(26) = 112015, and there are no other terms below 158000.

Crossrefs

Programs

  • Mathematica
    f[n_] := Log2[NestWhile[DivisorSigma[0, #] &, n!, # != 2^IntegerExponent[#, 2] &]]; (* A380802 *) seq[len_] := Module[{v = Table[0, {len}], c = 0, k = 1, i}, While[c < len, i = f[k] + 1; If[i <= len && v[[i]] == 0, c++; v[[i]] = k]; k++]; v]; seq[15]
  • PARI
    f(n) = {my(m = n!); while(1 << valuation(m, 2) != m, m = numdiv(m)); valuation(m, 2);} \\ A380802
    list(len) = {my(v = vector(len), c = 0, k = 1, i); while(c < len, i = f(k) + 1; if(i <= len && v[i] == 0, c++; v[i] = k); k++); v;}