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 A377845 #8 Nov 10 2024 05:06:27
%S A377845 216,864,1000,1080,1512,1944,2376,2744,2808,3000,3375,3456,3672,4000,
%T A377845 4104,4320,4968,5400,6048,6264,6696,6750,7000,7560,7776,7992,8232,
%U A377845 8856,9000,9261,9288,9504,9720,10152,10584,10648,10976,11000,11232,11448,11880,12000,12744,13000
%N A377845 Numbers that have more than one odd exponent larger than 1 in their prime factorization.
%C A377845 The asymptotic density of this sequence is 1 - Product_{p prime} (1 - 1/(p^2*(p+1))) * (1 + Sum_{p prime} (1/(p^3+p^2-1))) = 0.0035024748296318122535... .
%H A377845 Amiram Eldar, <a href="/A377845/b377845.txt">Table of n, a(n) for n = 1..10000</a>
%t A377845 q[n_] := Count[FactorInteger[n][[;; , 2]], _?(# > 1 && OddQ[#] &)] > 1; Select[Range[13000], q]
%o A377845 (PARI) is(k) = #select(x -> x>1 && x%2, factor(k)[, 2]) > 1;
%Y A377845 Complement of the union of A335275 and A377844.
%Y A377845 Subsequence of A295661.
%Y A377845 Subsequences: A162142, A179671, A190011.
%Y A377845 Cf. A065465.
%K A377845 nonn,easy
%O A377845 1,1
%A A377845 _Amiram Eldar_, Nov 09 2024