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.

A351075 Numbers k such that the maximal exponent in the prime factorization of A327860(k) is less than A051903(k), the maximal exponent in the prime factorization of k.

This page as a plain text file.
%I A351075 #13 Feb 02 2022 20:40:05
%S A351075 2,4,6,9,12,30,32,40,48,60,63,64,68,75,76,81,96,104,108,112,128,160,
%T A351075 192,210,212,220,224,225,240,242,243,245,248,250,256,270,272,275,276,
%U A351075 279,280,284,288,304,312,320,324,336,352,384,420,423,424,425,428,436,448,456,459,464,472,480,484,486,488,490,492,495,496
%N A351075 Numbers k such that the maximal exponent in the prime factorization of A327860(k) is less than A051903(k), the maximal exponent in the prime factorization of k.
%C A351075 Numbers k for which A328391(k) < A051903(k).
%H A351075 Antti Karttunen, <a href="/A351075/b351075.txt">Table of n, a(n) for n = 1..26720; terms <= 9699690</a>
%H A351075 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%o A351075 (PARI)
%o A351075 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A351075 A327860(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= (p^e); s += (e/p); n = n\p; p = nextprime(1+p)); (s*m); };
%o A351075 isA351075(n) = (A051903(A327860(n)) < A051903(n));
%Y A351075 Cf. A003415, A276086, A051903, A327860, A328391, A351076 (complement), A351077 (and its characteristic function).
%Y A351075 Positions of negative terms in A351074.
%Y A351075 Subsequence of A351038.
%Y A351075 Cf. also A350075.
%K A351075 nonn,base
%O A351075 1,1
%A A351075 _Antti Karttunen_, Feb 01 2022