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.

A348934 Numbers k congruent to 1 or 5 mod 6, for which A348930(k^2) > k^2.

This page as a plain text file.
%I A348934 #10 Nov 04 2021 20:47:21
%S A348934 5,11,17,23,25,29,41,47,49,53,55,59,71,83,85,89,101,107,113,115,121,
%T A348934 125,131,137,145,149,167,169,173,179,187,191,197,205,227,233,235,239,
%U A348934 245,251,253,257,263,265,269,275,281,289,293,295,311,317,319,343,347,353,355,359,361,383,389,391,401,415,419,425,431
%N A348934 Numbers k congruent to 1 or 5 mod 6, for which A348930(k^2) > k^2.
%C A348934 See comments in A348933.
%H A348934 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%t A348934 s[n_] := n / 3^IntegerExponent[n, 3]; Select[Range[450], MemberQ[{1, 5}, Mod[#, 6]] && s[DivisorSigma[1, #^2]] > #^2 &] (* _Amiram Eldar_, Nov 04 2021 *)
%o A348934 (PARI)
%o A348934 A038502(n) = (n/3^valuation(n, 3));
%o A348934 A348930(n) = A038502(sigma(n));
%o A348934 isA348934(n) = ((n%2)&&(n%3)&&(A348930(n^2)>(n^2)));
%Y A348934 Cf. A348930, A348932, A348933, A348936.
%K A348934 nonn
%O A348934 1,1
%A A348934 _Antti Karttunen_, Nov 04 2021