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.

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

This page as a plain text file.
%I A336559 #7 Jul 27 2020 21:09:56
%S A336559 6,12,14,15,18,20,24,26,28,36,38,39,44,45,48,50,51,54,56,60,62,63,68,
%T A336559 72,74,75,76,78,80,86,87,92,95,96,99,100,104,108,111,112,116,117,122,
%U A336559 123,124,126,134,143,144,146,147,148,150,153,158,159,162,171,172,175,176,180,183,188,192,194,196,200,204,206,207
%N A336559 Numbers k, not powers of primes, such that A336456(k) = Product_{p^e|k} A336456(p^e). Here each p^e is the maximal power of prime p that divides k, and A336456(k) = A335915(sigma(sigma(k))).
%H A336559 Antti Karttunen, <a href="/A336559/b336559.txt">Table of n, a(n) for n = 1..25000</a>
%o A336559 (PARI) isA336559(n) = ((n>1) && !isprimepower(n) && A336556(n)); \\ Needs also code from A336556.
%Y A336559 Terms of A336557 without those of A000961.
%Y A336559 Cf. A335915, A336456, A336556, A336558, A336560.
%Y A336559 Cf. A336549 (a subsequence).
%K A336559 nonn
%O A336559 1,1
%A A336559 _Antti Karttunen_, Jul 25 2020