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.

A295655 a(n) = A000203(n) / A294896(n) = A000203(n) / gcd(A000203(n), A005187(n)).

This page as a plain text file.
%I A295655 #8 Nov 27 2017 12:44:24
%S A295655 1,1,1,1,3,6,8,1,13,1,12,14,14,24,12,1,9,39,4,21,32,36,4,30,31,6,4,56,
%T A295655 5,9,32,1,3,9,48,13,38,60,28,15,42,32,22,84,39,9,48,62,3,93,36,98,9,
%U A295655 15,24,120,8,45,60,42,62,96,13,1,21,72,68,63,32,144,12,195,74,114,62,140,16,21,80,93,121,18,14
%N A295655 a(n) = A000203(n) / A294896(n) = A000203(n) / gcd(A000203(n), A005187(n)).
%H A295655 Antti Karttunen, <a href="/A295655/b295655.txt">Table of n, a(n) for n = 1..16384</a>
%H A295655 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A295655 a(n) = A000203(n) / A294896(n) = A000203(n) / gcd(A000203(n), A005187(n)).
%t A295655 Array[#1/GCD[#1, #2] & @@ {DivisorSigma[1, #], IntegerExponent[(2 #)!, 2]} &, 83] (* _Michael De Vlieger_, Nov 26 2017 *)
%Y A295655 Cf. A000203, A005187, A294896, A295656.
%K A295655 nonn
%O A295655 1,5
%A A295655 _Antti Karttunen_, Nov 25 2017