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.

A338519 Integers that can be expressed as a product d*tau(d), where tau is the number of divisors function, in a single way.

This page as a plain text file.
%I A338519 #13 Nov 01 2020 08:05:07
%S A338519 1,4,6,10,12,14,22,24,26,27,32,34,38,40,46,56,58,60,62,72,74,75,80,82,
%T A338519 84,86,88,94,104,106,118,120,122,132,134,136,140,142,146,147,152,156,
%U A338519 158,166,168,178,184,194,202,204,206,214,218,220,226,228,232,240,248,254
%N A338519 Integers that can be expressed as a product d*tau(d), where tau is the number of divisors function, in a single way.
%C A338519 Integers m such that A327166(m) = 1.
%H A338519 Seiichi Manyama, <a href="/A338519/b338519.txt">Table of n, a(n) for n = 1..10000</a>
%o A338519 (PARI) f(n) = sumdiv(n, d, d*numdiv(d) == n); \\ A327166
%o A338519 isok(n) = f(n)==1;
%Y A338519 Cf. A000005, A038040, A327166, A338382.
%Y A338519 Subsequences: A100484 (2*p), A079705 (3*p^2) that gives odd terms.
%Y A338519 Cf. A338520 (similar for sum of divisors).
%K A338519 nonn
%O A338519 1,2
%A A338519 _Michel Marcus_, Nov 01 2020