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.

A083260 a(n) = gcd(A046523(n), A071364(n)).

This page as a plain text file.
%I A083260 #9 Aug 24 2017 13:38:32
%S A083260 1,2,2,4,2,6,2,8,4,6,2,12,2,6,6,16,2,6,2,12,6,6,2,24,4,6,8,12,2,30,2,
%T A083260 32,6,6,6,36,2,6,6,24,2,30,2,12,12,6,2,48,4,6,6,12,2,6,6,24,6,6,2,60,
%U A083260 2,6,12,64,6,30,2,12,6,30,2,72,2,6,6,12,6,30,2,48,16,6,2,60,6,6,6,24,2,30,6
%N A083260 a(n) = gcd(A046523(n), A071364(n)).
%H A083260 Antti Karttunen, <a href="/A083260/b083260.txt">Table of n, a(n) for n = 1..10000</a>
%o A083260 (PARI)
%o A083260 A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ This function from _Charles R Greathouse IV_, Aug 17 2011
%o A083260 A071364(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = prime(i)); factorback(f); }; \\ This function from _Michel Marcus_, Jun 13 2014
%o A083260 A083260(n) = gcd(A046523(n), A071364(n)); \\ _Antti Karttunen_, Aug 24 2017
%Y A083260 Cf. A046523, A071364, A083255, A083256, A083257, A083258, A083259, A083261.
%K A083260 nonn
%O A083260 1,2
%A A083260 _Labos Elemer_, May 09 2003