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.

Showing 1-1 of 1 results.

A349260 a(n) is the least number k such that A349258(k) = n.

Original entry on oeis.org

1, 2, 6, 8, 24, 120, 216, 128, 384, 1920, 3456, 17280, 120960, 432000, 279936, 32768, 98304, 491520, 884736, 4423680, 30965760, 110592000, 71663616, 358318080, 2508226560, 8957952000, 62705664000, 689762304000, 3072577536000, 5598720000000, 470184984576, 2147483648
Offset: 0

Views

Author

Amiram Eldar, Nov 12 2021

Keywords

Examples

			a(2) = 6 since A349258(6) = 2 and A349258(k) != 2 for all k < 6.
		

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := 2^DigitCount[e, 2, 1] - 1; d[1] = 0; d[n_] := Plus @@ f @@@ FactorInteger[n]; seq[len_, nmax_] := Module[{s = Table[0, {len}], k = 0, n = 1, i}, While[k < len && n < nmax, i = d[n] + 1; If[i <= len && s[[i]] == 0, k++; s[[i]] = n]; n++]; TakeWhile[s, # > 0 &]]; seq[15, 10^6]
Showing 1-1 of 1 results.