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.

A364541 Numbers k for which A005940(k) <= k.

This page as a plain text file.
%I A364541 #7 Jul 28 2023 10:35:02
%S A364541 1,2,3,4,5,6,8,9,10,12,16,17,18,20,24,32,33,34,35,36,40,48,64,65,66,
%T A364541 67,68,69,70,72,80,96,128,129,130,131,132,133,134,135,136,137,138,140,
%U A364541 144,160,192,256,257,258,259,260,261,262,263,264,265,266,267,268,270,272,273,274,276,280,288,289,320,384,385,512
%N A364541 Numbers k for which A005940(k) <= k.
%C A364541 A029747 is included as a subsequence, because it gives the known fixed points of map n -> A005940(n).
%t A364541 nn = 512; Array[Set[a[#], #] &, 2]; Do[If[EvenQ[n], Set[a[n], 2 a[n/2]], Set[a[n], Times @@ Power @@@ Map[{Prime[PrimePi[#1] + 1], #2} & @@ # &, FactorInteger[a[(n + 1)/2]]]]], {n, 3, nn}]; Select[Range[nn], a[#] <= # &] (* _Michael De Vlieger_, Jul 28 2023 *)
%o A364541 (PARI)
%o A364541 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
%o A364541 isA364541(n) = (A005940(n)<=n);
%Y A364541 Positions of nonpositive terms in A364499.
%Y A364541 Cf. A005940, A364542.
%Y A364541 Subsequences: A029747, A364540.
%K A364541 nonn
%O A364541 1,2
%A A364541 _Antti Karttunen_, Jul 28 2023