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.

A336549 Numbers k, not powers of primes, such that A051027(k) = Product_{p^e|k} A051027(p^e). Here each p^e is the maximal power of prime p that divides k, and A051027(k) = sigma(sigma(k)).

This page as a plain text file.
%I A336549 #9 Jul 27 2020 21:09:25
%S A336549 6,12,14,18,20,24,26,28,36,38,44,45,48,50,54,56,62,63,68,72,74,75,76,
%T A336549 80,86,92,96,99,100,104,108,112,116,117,122,124,126,134,144,146,147,
%U A336549 148,150,153,158,162,171,172,175,176,180,188,192,194,196,200,206,207,208,212,218,224,225,234,236,242,244,248,252,254
%N A336549 Numbers k, not powers of primes, such that A051027(k) = Product_{p^e|k} A051027(p^e). Here each p^e is the maximal power of prime p that divides k, and A051027(k) = sigma(sigma(k)).
%H A336549 Antti Karttunen, <a href="/A336549/b336549.txt">Table of n, a(n) for n = 1..25000</a>
%H A336549 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o A336549 (PARI) isA336549(n) = ((n>1) && !isprimepower(n) && A336546(n)); \\ Needs also code from A336546.
%Y A336549 Terms of A336547 without A000961.
%Y A336549 Cf. A051027, A336546, A336548.
%Y A336549 Subsequence of A336559. Cf also A336560.
%K A336549 nonn
%O A336549 1,1
%A A336549 _Antti Karttunen_, Jul 25 2020