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.

A305183 Least k such that A048272(k) = -n.

This page as a plain text file.
%I A305183 #17 Nov 22 2023 22:33:34
%S A305183 2,4,8,16,24,64,48,256,96,144,192,4096,240,16384,768,576,480,262144,
%T A305183 720,1048576,960,2304,12288,16777216,1440,5184,49152,3600,3840,
%U A305183 1073741824,2880,4294967296,3360,36864,786432,20736,5040,274877906944,3145728,147456,6720,4398046511104,11520,17592186044416
%N A305183 Least k such that A048272(k) = -n.
%C A305183 All terms are even.
%F A305183 a(n) = 2 * A187941(n).
%F A305183 a(n) = 4 * A005179(n) for n > 0.
%o A305183 (PARI) a048272(n) = sumdiv(n, d, if (d%2, 1, -1));
%o A305183 a(n) = {my(k=1); while (a048272(k) != -n, k++); k;} \\ _Michel Marcus_, May 27 2018
%Y A305183 Cf. A005179, A048272, A187941.
%Y A305183 Cf. A038547 (similar but with n instead of -n).
%K A305183 nonn
%O A305183 0,1
%A A305183 _Seiichi Manyama_, May 26 2018