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.

A365470 (2,6)-imperfect numbers.

This page as a plain text file.
%I A365470 #37 Sep 19 2023 01:44:05
%S A365470 6,12,24,30,60,120,252,384,510,864,1020,1260,1920,2040,2640,5418,
%T A365470 12960,21420,21672,32640,75852,98304,108864,131070,262140,346752,
%U A365470 379260,491520,524280,1982988,2296728,5504940,6447420,8355840,8388480,36747648,39009600,57024000
%N A365470 (2,6)-imperfect numbers.
%C A365470 Based on testing the first 38 terms, it seems this is a subsequence of Zumkeller numbers (A083207). - _Ivan N. Ianakiev_, Sep 12 2023
%H A365470 Amiram Eldar, <a href="/A365470/b365470.txt">Table of n, a(n) for n = 1..56</a>
%H A365470 László Tóth, <a href="http://arxiv.org/abs/1111.4842">A survey of the alternating sum-of-divisors function</a>, arXiv:1111.4842 [math.NT], 2011-2014. See p. 7.
%t A365470 beta[n_]:=Sum[d*LiouvilleLambda[n/d],{d,Divisors[n]}]; Select[Range[5500],#==6*beta[beta[#]]&] (* _Ivan N. Ianakiev_, Sep 12 2023 *)
%o A365470 (PARI) beta(n) = sumdiv(n, d, d*(-1)^bigomega(n/d));
%o A365470 isok(k) = 6*beta(beta(k)) == k;
%Y A365470 Cf. A127725 (2-imperfect), A206367 ((2,3)-imperfect).
%Y A365470 Cf. A206369 (beta).
%Y A365470 Subsequence of A008588.
%K A365470 nonn
%O A365470 1,1
%A A365470 _Michel Marcus_, Sep 11 2023