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.

A348931 Numbers k congruent to 1 or 5 mod 6, for which A348930(k) < k.

This page as a plain text file.
%I A348931 #11 Nov 04 2021 20:47:02
%S A348931 5,11,17,23,29,35,41,47,49,53,55,59,65,71,77,83,85,89,95,101,107,113,
%T A348931 115,119,125,131,137,143,145,149,155,161,167,169,173,179,185,187,191,
%U A348931 197,203,205,209,215,221,227,233,235,239,245,251,253,257,263,265,269,275,281,287,293,295,299,305,311,317,319,323
%N A348931 Numbers k congruent to 1 or 5 mod 6, for which A348930(k) < k.
%C A348931 See comments in A348930.
%H A348931 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%t A348931 s[n_] := n / 3^IntegerExponent[n, 3]; Select[Range[350], MemberQ[{1, 5}, Mod[#, 6]] && s[DivisorSigma[1, #]] < # &] (* _Amiram Eldar_, Nov 04 2021 *)
%o A348931 (PARI)
%o A348931 A038502(n) = (n/3^valuation(n, 3));
%o A348931 A348930(n) = A038502(sigma(n));
%o A348931 isA348931(n) = ((n%2)&&(n%3)&&(A348930(n)<n));
%Y A348931 Cf. A007310, A348930, A348932, A348933.
%Y A348931 Cf. also A348741, A348753.
%K A348931 nonn
%O A348931 1,1
%A A348931 _Antti Karttunen_, Nov 04 2021