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.

A230498 a(n) is the minimal odd odious k>1, such that k^i, i=2,...,n, all are evil, and a(n)=0, if there is no such k.

Original entry on oeis.org

13, 21, 21, 47, 265, 607, 883, 883, 883, 883, 10865, 10865, 58241, 58241, 58241, 75781, 367815, 766165, 2931371, 5288671, 5288671, 14838843, 14838843, 14838843, 33417397, 737812313, 2774333869, 3513898753, 3513898753, 3513898753, 14369883465, 14369883465, 22865025261
Offset: 2

Views

Author

Keywords

Comments

A conjugate sequence to A230495 and A230496.
Conjecture: For all n, a(n) > 0.

Crossrefs

Programs

  • Mathematica
    evQ[n_] := EvenQ[DigitCount[n, 2, 1]]; evExp[n_] := Module[{e = 1, p = n^2}, If[! evQ[n], While[evQ[p], p *= n; e++]]; e]; seq[nmax_] := Module[{e, emax = 1, n = 3, s = {}}, Do[e = evExp[n]; If[e > emax, s = Join[s, ConstantArray[n, e - emax]]; emax = e], {n, 3, nmax, 2}]; s]; seq[11000] (* Amiram Eldar, Aug 03 2023 *)

Extensions

a(27)-a(34) from Amiram Eldar, Aug 03 2023