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.

A348997 a(n) = A348733(A276086(n)), where A348733(n) = gcd(A003959(n), A034448(n)), and A276086 gives the prime product form of primorial base expansion of n.

This page as a plain text file.
%I A348997 #12 Nov 13 2021 22:33:15
%S A348997 1,3,4,12,2,6,6,18,24,72,12,36,2,6,8,24,4,12,18,54,72,216,36,108,2,6,
%T A348997 8,24,4,12,8,24,32,96,16,48,48,144,192,576,96,288,16,48,64,192,32,96,
%U A348997 144,432,576,1728,288,864,16,48,64,192,32,96,2,6,8,24,4,12,12,36,48,144,24,72,4,12,16,48,8,24,36,108,144
%N A348997 a(n) = A348733(A276086(n)), where A348733(n) = gcd(A003959(n), A034448(n)), and A276086 gives the prime product form of primorial base expansion of n.
%H A348997 Antti Karttunen, <a href="/A348997/b348997.txt">Table of n, a(n) for n = 0..11550</a>
%H A348997 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A348997 a(n) = A348733(A276086(n)) = gcd(A348949(n), A348996(n)).
%o A348997 (PARI) A348997(n) = { my(m1=1, m2=1, p=2); while(n, if(n%p, m1 *= ((1+p)^(n%p)); m2 *= (1+(p^(n%p)))); n = n\p; p = nextprime(1+p)); gcd(m1, m2); };
%Y A348997 Cf. A003959, A034448, A276086, A348733, A348949, A348996.
%Y A348997 Cf. also A346471 for similar construction. (Compare the scatter plots).
%K A348997 nonn,base,look
%O A348997 0,2
%A A348997 _Antti Karttunen_, Nov 07 2021