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.

A135130 Let n = Product_{p} p ^ e_p be the prime factorization of n and let M = max{e_p + 1 }. Then n is in the sequence iff for all primes q in the range 3 <= q <= M we have e_q >= Sum_{r} floor( log_q (e_r + 1) ).

This page as a plain text file.
%I A135130 #7 Jan 06 2021 22:22:40
%S A135130 1,2,3,5,6,7,9,10,11,12,13,14,15,17,18,19,21,22,23,24,26,27,29,30,31,
%T A135130 33,34,35,36,37,38,39,41,42,43,45,46,47,51,53,54,55,57,58,59,60,61,62,
%U A135130 63,65,66,67,69,70,71,72,73,74,75,77,78,79,82,83,84,85,86,87,89,90,91,93,94,95,97
%N A135130 Let n = Product_{p} p ^ e_p be the prime factorization of n and let M = max{e_p + 1 }. Then n is in the sequence iff for all primes q in the range 3 <= q <= M we have e_q >= Sum_{r} floor( log_q (e_r + 1) ).
%C A135130 A variant of A141586, which is a subsequence.
%H A135130 N. J. A. Sloane, <a href="/A135130/a135130.txt">Maple program</a>
%Y A135130 Cf. A141586, A143718.
%K A135130 nonn
%O A135130 1,2
%A A135130 _N. J. A. Sloane_, Nov 29 2008