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.

A337534 Nontrivial squares together with nonsquares whose square part's square root is in the sequence.

This page as a plain text file.
%I A337534 #15 Feb 16 2025 08:34:00
%S A337534 4,9,16,25,32,36,48,49,64,80,81,96,100,112,121,144,160,162,169,176,
%T A337534 196,208,224,225,240,243,256,272,289,304,324,336,352,361,368,400,405,
%U A337534 416,441,464,480,484,486,496,512,528,529,544,560,567,576,592,608,624,625
%N A337534 Nontrivial squares together with nonsquares whose square part's square root is in the sequence.
%C A337534 The appearance of a number is determined by its prime signature.
%C A337534 No terms are squarefree, as the square root of the square part of a squarefree number is 1.
%C A337534 If the square part of k is a 4th power, other than 1, k appears.
%C A337534 Every positive integer k is the product of a unique subset S_k of the terms of A050376, which are arranged in array form in A329050 (primes in column 0, squares of primes in column 1, 4th powers of primes in column 2 and so on). k is in this sequence if and only if there is m >= 1 such that column m of A329050 contains a member of S_k, but column m - 1 does not.
%H A337534 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SquarePart.html">Square part</a>
%H A337534 <a href="/index/Pri#prime_signature">Index to sequences related to prime signature</a>
%F A337534 Numbers k such that A209229(A267116(k) + 1) = 0.
%F A337534 A008833(a(n)) > 1.
%e A337534 4 is square and nontrivial (not 1), so 4 is in the sequence.
%e A337534 12 = 3 * 2^2 is nonsquare, but has square part 4, whose square root (2) is not in the sequence. So 12 is not in the sequence.
%e A337534 32 = 2 * 4^2 is nonsquare, and has square part 16, whose square root (4) is in the sequence. So 32 is in the sequence.
%p A337534 A337534 := proc(n)
%p A337534     option remember ;
%p A337534     if n =1  then
%p A337534         4;
%p A337534     else
%p A337534         for a from procname(n-1)+1 do
%p A337534             if A209229(A267116(a)+1) = 0 then
%p A337534                 return a;
%p A337534             end if;
%p A337534         end do:
%p A337534     end if;
%p A337534 end proc:
%p A337534 seq(A337534(n),n=1..80) ; # _R. J. Mathar_, Feb 16 2021
%t A337534 pow2Q[n_] := n == 2^IntegerExponent[n, 2]; Select[Range[625], ! pow2Q[1 + BitOr @@ (FactorInteger[#][[;; , 2]])] &] (* _Amiram Eldar_, Sep 18 2020 *)
%Y A337534 Complement of A337533.
%Y A337534 Subsequences: A000290\{0,1}, A082294.
%Y A337534 Subsequence of: A013929, A162643.
%Y A337534 A209229, A267116 are used in a formula defining this sequence.
%Y A337534 Cf. A008833, A050376, A329050.
%K A337534 nonn,easy
%O A337534 1,1
%A A337534 _Peter Munn_, Aug 31 2020