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.
%I A351038 #23 Feb 04 2024 09:02:12
%S A351038 2,3,4,6,7,8,9,12,16,30,31,32,33,36,37,38,39,40,44,45,48,60,63,64,68,
%T A351038 72,75,76,80,81,96,104,108,112,128,144,160,192,210,211,212,213,216,
%U A351038 217,218,219,220,224,225,232,240,241,242,243,244,245,246,247,248,249,250,252,256,270,272,275,276,279,280,284,288,304
%N A351038 Numbers whose maximal digit in their primorial base expansion is not larger than the maximal exponent in their prime factorization.
%C A351038 Numbers k for which A328114(k) <= A051903(k).
%C A351038 Numbers such that when the map x -> A276086(x) is applied to them, the maximal exponent in the prime factorization (A051903) doesn't increase.
%H A351038 Antti Karttunen, <a href="/A351038/b351038.txt">Table of n, a(n) for n = 1..28472; terms <= 9699690</a>
%H A351038 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%o A351038 (PARI)
%o A351038 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A351038 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A351038 isA351038(n) = (A051903(A276086(n)) <= A051903(n));
%Y A351038 Cf. A051903, A276086, A328114, A351039 (characteristic function), A351069 and A351070 (counts).
%Y A351038 Positions of nonpositive terms in A350074.
%Y A351038 Subsequences: A350075, A351075, also A369645 (after its initial 1).
%Y A351038 Cf. also A341518.
%K A351038 nonn,base
%O A351038 1,1
%A A351038 _Antti Karttunen_, Feb 01 2022