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.

A361468 a(n) = A249670(A003961(n)).

This page as a plain text file.
%I A361468 #10 Mar 21 2023 07:16:23
%S A361468 1,12,30,117,56,40,132,1080,775,672,182,390,306,176,1680,9801,380,
%T A361468 9300,552,6552,3960,2184,870,144,2793,408,19500,1716,992,2240,1406,
%U A361468 88452,5460,4560,7392,90675,1722,736,9180,60480,1892,5280,2256,126,43400,1160,2862,32670,16093,3724,456,442,3540,26000
%N A361468 a(n) = A249670(A003961(n)).
%H A361468 Winston de Greef, <a href="/A361468/b361468.txt">Table of n, a(n) for n = 1..10000</a>
%H A361468 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A361468 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A361468 a(n) = A249670(A003961(n)) = A336849(n) * A341525(n).
%F A361468 a(n) = A361467(n) / A000290(A336850(n)).
%o A361468 (PARI)
%o A361468 A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
%o A361468 A249670(n) = { my(ab = sigma(n)/n); numerator(ab)*denominator(ab); };
%o A361468 A361468(n) = A249670(A003961(n));
%Y A361468 Cf. A000290, A003961, A249670, A336850, A361467.
%K A361468 nonn
%O A361468 1,2
%A A361468 _Antti Karttunen_, Mar 20 2023