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.

A351076 Numbers k such that the maximal exponent in the prime factorization of A327860(k) is greater than or equal to A051903(k), the maximal exponent in the prime factorization of k.

This page as a plain text file.
%I A351076 #5 Feb 02 2022 21:23:21
%S A351076 1,3,5,7,8,10,11,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,
%T A351076 31,33,34,35,36,37,38,39,41,42,43,44,45,46,47,49,50,51,52,53,54,55,56,
%U A351076 57,58,59,61,62,65,66,67,69,70,71,72,73,74,77,78,79,80,82,83,84,85,86,87,88,89,90,91,92,93,94,95,97,98
%N A351076 Numbers k such that the maximal exponent in the prime factorization of A327860(k) is greater than or equal to A051903(k), the maximal exponent in the prime factorization of k.
%C A351076 Numbers k for which A328391(k) >= A051903(k).
%H A351076 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%o A351076 (PARI)
%o A351076 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A351076 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 A351076 isA351076(n) = (A051903(A327860(n)) >= A051903(n));
%Y A351076 Cf. A003415, A276086, A051903, A327860, A328391, A351075 (complement), A351077 (the characteristic function).
%Y A351076 Positions of nonnegative terms in A351074.
%Y A351076 Cf. also A350076.
%K A351076 nonn
%O A351076 1,2
%A A351076 _Antti Karttunen_, Feb 01 2022